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 A219479 #15 Jan 05 2025 19:51:39 %S A219479 1,1,0,0,0,0,1,2,1,0,0,0,0,2,2,0,0,0,0,1,3,2,0,0,0,0,2,3,1,0,0,0,0,3, %T A219479 3,0,0,0,0,2,4,2,0,0,0,0,3,3,0,0,0,0,1,4,3,0,0,0,0,3,5,2,0,0,0,0,4,4, %U A219479 0,0,0,0,2,5,3,0,0,0,0,3,4,1,0,0,0,0,4,4,0,0,0,0,3,6,3,0,0,0,0,5,5 %N A219479 Number of representations of n as a sum of distinct elements of the generalized Fibonacci sequence beginning 1, 6, 7, 13, 20, 33, 53, .... %D A219479 J. Berstel, An Exercise on Fibonacci Representations, RAIRO/Informatique Theorique, Vol. 35, No 6, 2001, pp. 491-498. %H A219479 Alois P. Heinz, <a href="/A219479/b219479.txt">Table of n, a(n) for n = 0..17101</a> %H A219479 D. A. Klarner, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/4-4.html">Representations of N as a sum of distinct elements from special sequences</a>, Fib. Quart., 4 (1966), 289-306 and 322. %H A219479 C. Mongoven, <a href="http://caseymongoven.com/b1490">Musical Composition Based on This Sequence</a>. %Y A219479 Cf. A000121, A000119, A067595, A003263, A103344. %K A219479 nonn %O A219479 0,8 %A A219479 _Casey Mongoven_, Nov 20 2012 %E A219479 a(0)=1 from _Alois P. Heinz_, Sep 16 2015