login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A359512 Number of partitions of n into at most 3 positive Fibonacci numbers (with a single type of 1). 4

%I #8 Jan 04 2023 18:31:30

%S 1,1,2,3,3,4,4,4,4,4,4,4,3,4,3,4,4,3,4,3,1,4,2,4,4,2,4,3,2,4,1,3,1,0,

%T 4,2,3,4,2,4,2,1,4,2,3,2,0,4,1,1,3,0,1,0,0,4,2,3,3,2,4,2,1,4,1,2,1,0,

%U 4,2,2,3,0,2,0,0,4,1,1,1,0,3,0,0,1,0,0,0,0,4,2,3,3

%N Number of partitions of n into at most 3 positive Fibonacci numbers (with a single type of 1).

%F a(n) = Sum_{k=0..3} A319394(n,k). - _Alois P. Heinz_, Jan 03 2023

%Y Cf. A000045, A003107, A319394, A319396, A359511, A359513, A359515.

%K nonn

%O 0,3

%A _Ilya Gutkovskiy_, Jan 03 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 31 03:21 EDT 2024. Contains 374774 sequences. (Running on oeis4.)