|
| |
|
|
A094607
|
|
Rectangular array T by antidiagonals: row n consists of the positive integers k for which there are exactly n sets of Fibonacci numbers whose sum is k.
|
|
1
| |
|
|
1, 2, 3, 4, 5, 8, 7, 6, 11, 16, 12, 9, 13, 21, 24, 20, 10, 14, 26, 29, 37, 33, 15, 18, 27, 39, 42, 58, 54, 17, 19, 32, 40, 45, 66, 63, 88, 25, 22, 34, 47, 50, 76, 71, 97, 143, 28, 23, 35, 48, 60, 84, 79, 100, 105, 232, 41, 30, 43, 55, 61, 94, 92, 131, 113, 152, 376, 46, 31, 44
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Row n gives the ranks of n in A000119 after the initial 1 is deleted. Every positive integer occurs exactly once in T; thus a is a permutation of the positive integers. Row 1 is A000071 except for initial terms. Column 1 is A013583.
|
|
|
EXAMPLE
| A northwest corner of T:
1 2 4 7 12
3 5 6 9 10
8 11 13 14 18
16 21 26 27 32
6 is in row 2 because there are exactly 2 sets of Fibonacci
numbers whose sum is 6. They are {1,5} and {1,2,3}.
|
|
|
CROSSREFS
| Cf. A000045, A000119, A094608.
Sequence in context: A130352 A082314 A156552 * A098098 A080785 A069797
Adjacent sequences: A094604 A094605 A094606 * A094608 A094609 A094610
|
|
|
KEYWORD
| nonn,tabl
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu), May 14 2004
|
| |
|
|
