|
%I #13 Sep 16 2015 10:28:22
%S 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 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 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 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 J. Berstel, An Exercise on Fibonacci Representations, RAIRO/Informatique Theorique, Vol. 35, No 6, 2001, pp. 491-498.
%H Alois P. Heinz, <a href="/A219479/b219479.txt">Table of n, a(n) for n = 0..17101</a>
%H D. A. Klarner, <a href="http://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 C. Mongoven, <a href="http://caseymongoven.com/b1490">Musical Composition Based on This Sequence</a>.
%Y Cf. A000121, A000119, A067595, A003263, A103344.
%K nonn
%O 0,8
%A _Casey Mongoven_, Nov 20 2012
%E a(0)=1 from _Alois P. Heinz_, Sep 16 2015
|
