×
Prodinger, Helmut

On the number of Fibonacci partitions of a set. (English) Zbl 0475.05009

Fibonacci Q. 19, 463-465 (1981).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0475.05009

Cited in 1 Review
Cited in 6 Documents

MSC:

05A17 Combinatorial aspects of partitions of integers
11B39 Fibonacci and Lucas numbers and polynomials and generalizations
11P81 Elementary theory of partitions

Keywords:

d-Fibonacci partition; Bell number
PDF BibTeX XML Cite
\textit{H. Prodinger}, Fibonacci Q. 19, 463--465 (1981; Zbl 0475.05009)

Online Encyclopedia of Integer Sequences:

Number of partitions of 2n^2 whose Ferrers-plot fits within a 2n X 2n box; number of ways to cut a 2n X 2n chessboard into two equal-area pieces along a non-descending line from lower left to upper right.