%I A120526
%S A120526 1,0,1,1,0,0,1,1,1,0,1,1,1,0,0,0,1,1,1,0,1,1,1,0,1,1,1,0,0,1,1,1,0,1,1,
%T A120526 1,0,1,1,1,0,0,0,0,1,1,1,0,1,1,1,0,1,1,1,0,0,1,1,1,0,1,1,1,0,1,1,1,0,0,
%U A120526 1,1,1,0,1
%N A120526 First differences of successive generalized meta-Fibonacci numbers A120504.
%H A120526 C. Deugau and F. Ruskey, <a href="http://www.cs.uwaterloo.ca/journals/
               JIS/VOL12/Ruskey/ruskey6.pdf">Complete k-ary Trees and Generalized 
               Meta-Fibonacci Sequences</a>, J. Integer Seq., Vol. 12. [This is 
               a later version than that in the GenMetaFib.html link]
%H A120526 C. Deugau and F. Ruskey, <a href="http://www.cs.uvic.ca/~ruskey/Publications/
               MetaFib/GenMetaFib.html">Complete k-ary Trees and Generalized Meta-Fibonacci 
               Sequences</a>
%F A120526 d(n) = 0 if node n is an inner node, or 1 if node n is a leaf.
%F A120526 g.f.: z (1 + z^2 ( (1 - z^(2 * [1])) / (1 - z^[1]) + z^4 * (1 - z^(3 
               * [i]))/(1 - z^[1]) ( (1 - z^(2 * [2])) / (1 - z^[2]) + z^10 * (1 
               - z^(3 * [2]))/(1 - z^[2]) (..., where [i] = (3^i - 1) / 2.
%F A120526 g.f.: D(z) = (1 - z) * z * sum(prod(z * (1 - z^(3 * [i])) / (1 - z^[i]), 
               i=1..n), n=0..infinity), where [i] = (3^i - 1) / 2.
%p A120526 d := n -> if n=1 then 1 else A120504(n)-A120504(n-1) fi;
%Y A120526 Cf. A120504, A120515.
%Y A120526 Sequence in context: A108882 A070829 A118175 this_sequence A086694 A093317 
               A127253
%Y A120526 Adjacent sequences: A120523 A120524 A120525 this_sequence A120527 A120528 
               A120529
%K A120526 nonn
%O A120526 1,1
%A A120526 Frank Ruskey (http://www.cs.uvic.ca/~ruskey/) and Chris Deugau (deugaucj(AT)uvic.ca), 
               Jun 20 2006