cp's OEIS Frontend

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.

A357688 Number of ways to write n as an ordered sum of four positive Fibonacci numbers (with a single type of 1).

This page as a plain text file.
%I A357688 #42 Aug 06 2023 14:49:25
%S A357688 1,4,10,16,23,28,34,36,43,48,50,48,50,56,58,64,67,60,58,52,64,64,70,
%T A357688 68,70,76,70,72,79,60,60,48,58,68,60,84,80,64,82,64,82,88,66,76,66,64,
%U A357688 84,60,79,60,24,60,36,60,74,48,88,76,72,96,68,88,76,48,82,60,70
%N A357688 Number of ways to write n as an ordered sum of four positive Fibonacci numbers (with a single type of 1).
%H A357688 Alois P. Heinz, <a href="/A357688/b357688.txt">Table of n, a(n) for n = 4..10000</a>
%F A357688 G.f.: ( Sum_{k>=2} x^Fibonacci(k) )^4.
%F A357688 a(n) = A121548(n,4).
%t A357688 nmax = 70; CoefficientList[Series[Sum[x^Fibonacci[k], {k, 2, 21}]^4, {x, 0, nmax}], x] // Drop[#, 4] &
%Y A357688 Cf. A000045, A076739, A121548, A121549, A121550, A319397, A357690, A357691.
%K A357688 nonn
%O A357688 4,2
%A A357688 _Ilya Gutkovskiy_, Oct 10 2022