Number of ways to write n as an ordered sum of nine positive Fibonacci numbers (with a single type of 1).
A357717
Number of ways to write n as an ordered sum of nine positive Fibonacci numbers (with a single type of 1).
Terms
- a(0) =1a(1) =9a(2) =45a(3) =156a(4) =423a(5) =954a(6) =1878a(7) =3321a(8) =5409a(9) =8251a(10) =11979a(11) =16686a(12) =22446a(13) =29250a(14) =37134a(15) =46107a(16) =56259a(17) =67671a(18) =80407a(19) =94338a(20) =109269a(21) =125118a(22) =141930a(23) =159723a(24) =178608a(25) =198522a(26) =219510a(27) =241338a(28) =264438a(29) =288810
External references
- oeis: A357717