This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A357690 #16 Oct 10 2022 12:43:09
%S A357690 1,5,15,30,50,71,95,115,140,165,191,205,220,240,260,285,310,325,325,
%T A357690 320,341,350,380,385,405,420,430,450,465,465,445,410,435,425,450,481,
%U A357690 495,515,490,510,555,525,580,540,530,570,530,580,600,520,525,440,455,520,445,555,530
%N A357690 Number of ways to write n as an ordered sum of five positive Fibonacci numbers (with a single type of 1).
%H A357690 Alois P. Heinz, <a href="/A357690/b357690.txt">Table of n, a(n) for n = 5..10000</a>
%F A357690 G.f.: ( Sum_{k>=2} x^Fibonacci(k) )^5.
%F A357690 a(n) = A121548(n,5).
%t A357690 nmax = 61; CoefficientList[Series[Sum[x^Fibonacci[k], {k, 2, 21}]^5, {x, 0, nmax}], x] // Drop[#, 5] &
%Y A357690 Cf. A000045, A076739, A121548, A121549, A121550, A319398, A357688, A357691.
%K A357690 nonn
%O A357690 5,2
%A A357690 _Ilya Gutkovskiy_, Oct 10 2022