|
%I #10 Sep 16 2015 10:30:58
%S 1,0,1,0,0,0,0,1,0,2,0,1,0,0,0,0,2,0,2,0,0,0,0,1,0,3,0,2,0,0,0,0,2,0,
%T 3,0,1,0,0,0,0,3,0,3,0,0,0,0,2,0,4,0,2,0,0,0,0,3,0,3,0,0,0,0,1,0,4,0,
%U 3,0,0,0,0,3,0,5,0,2,0,0,0,0,4,0,4,0,0,0,0,2,0,5,0,3,0,0,0,0,3,0,4,0,1,0,0
%N Number of representations of n as a sum of distinct elements of the generalized Fibonacci sequence beginning 2, 7, 9, 16, 25, 41, ....
%H Alois P. Heinz, <a href="/A219483/b219483.txt">Table of n, a(n) for n = 0..13153</a>
%H J. Berstel, <a href="http://www-igm.univ-mlv.fr/~berstel/Articles/2001ExerciceAldo.pdf">An Exercise on Fibonacci Representations</a>, RAIRO/Informatique Theorique, Vol. 35, No 6, 2001, pp. 491-498, in the issue dedicated to Aldo De Luca on the occasion of his 60th anniversary.
%H D. A. Klarner, Representations of N as a sum of distinct elements from special sequences, <a href="http://www.fq.math.ca/Scanned/4-4/klarner-a.pdf">part 1</a>, <a href="http://www.fq.math.ca/Scanned/4-4/klarner-b.pdf">part 2</a>, Fib. Quart., 4 (1966), 289-306 and 322.
%Y Cf. A000121, A000119, A067595, A003263, A103344.
%K nonn
%O 0,10
%A _Casey Mongoven_, Nov 20 2012
%E a(0)=1 from _Alois P. Heinz_, Sep 16 2015
|
