|
%I #27 Aug 01 2020 03:32:21
%S 1,0,0,1,1,1,1,1,1,1,1,2,0,1,2,1,2,1,2,1,0,2,2,2,2,1,2,2,1,3,1,1,2,1,
%T 2,2,2,3,1,2,3,1,3,2,2,3,1,3,2,1,3,2,2,2,1,2,2,2,4,1,3,3,1,4,3,3,3,1,
%U 3,3,2,4,2,3,3,1,4,2,2,4,2,3,3,2,3,2,2,3,0,2,3,2,4,2,4,3,1,5,3,3,4,2,4,4,3
%N Number of partitions of n with an even number of distinct Fibonacci parts.
%H Alois P. Heinz, <a href="/A093998/b093998.txt">Table of n, a(n) for n = 0..10946</a>
%H F. Ardila, <a href="https://www.fq.math.ca/Papers1/42-3/quartardila03_2004.pdf">The coefficients of a Fibonacci power series</a>, Fib. Quart. 42 (3) (2004), 202-204.
%H N. Robbins, <a href="https://www.fq.math.ca/Scanned/34-4/robbins.pdf">Fibonacci partitions</a>, Fib. Quart. 34 (4) (1996), 306-313.
%H J. Shallit, <a href="https://arxiv.org/abs/2007.14930">Robbins and Ardila meet Berstel</a>, Arxiv preprint arXiv:2007.14930 [math.CO], 2020.
%F G.f.: (Product_{k>=2} (1 + x^{F_k}) + Product_{k>=2} (1 - x^{F_k}))/2.
%p F:= combinat[fibonacci]:
%p b:= proc(n, i, t) option remember; `if`(n=0, t, `if`(i<2, 0,
%p b(n, i-1, t)+`if`(F(i)>n, 0, b(n-F(i), i-1, 1-t))))
%p end:
%p a:= proc(n) local j; for j from ilog[(1+sqrt(5))/2](n+1)
%p while F(j+1)<=n do od; b(n, j, 1)
%p end:
%p seq(a(n), n=0..100); # _Alois P. Heinz_, Jul 11 2013
%t Take[ CoefficientList[ Expand[ Product[1 + x^Fibonacci[k], {k, 2, 13}]/2 + Product[1 - x^Fibonacci[k], {k, 2, 13}]/2], x], 105] (* _Robert G. Wilson v_, May 29 2004 *)
%Y Cf. A000119, A093997.
%K easy,nonn
%O 0,12
%A _N. Sato_, May 24 2004
%E Edited and extended by _Robert G. Wilson v_, May 29 2004
|
