login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A359511
Number of partitions of n into at most 2 positive Fibonacci numbers (with a single type of 1).
4
1, 1, 2, 2, 2, 2, 2, 1, 2, 1, 2, 1, 0, 2, 1, 1, 2, 0, 1, 0, 0, 2, 1, 1, 1, 0, 2, 0, 0, 1, 0, 0, 0, 0, 2, 1, 1, 1, 0, 1, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 2, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 1, 1, 0, 1, 0, 0, 1
OFFSET
0,3
FORMULA
a(n) = Sum_{k=0..2} A319394(n,k). - Alois P. Heinz, Jan 03 2023
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jan 03 2023
STATUS
approved