%I A120513
%S A120513 1,5,10,11,17,18,20,21,28,29,31,32,35,36,38,39,47,48,50,51,54,55,57,58,
%T A120513 62,63,65,66,69,70,72,73,82,83,85,86,89,90,92,93,97,98,100,101,104,105,
%U A120513 107,108,113,114
%N A120513 a(n) = min{j : A120502(j) = n}.
%D A120513 B. Jackson and F. Ruskey, Meta-Fibonacci Sequences, Binary Trees and 
               Extremal Compact Codes, Electronic Journal of Combinatorics, 13 (2006), 
               #R26, 13 pages.
%H A120513 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 A120513 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 A120513 g.f.: P(z) = z / (1-z) * (1 + sum(z^(m^2) * (3 + 1 / (1 - z^(m^2))), 
               m=0..infinity))
%p A120513 p := proc(n)
%p A120513 if n=1 then return 1; end if;
%p A120513 for j from p(n-1)+1 to infinity do
%p A120513 if A120502(j) = n then return j; fi; od;
%p A120513 end proc;
%Y A120513 Cf. A120502, A120524.
%Y A120513 Sequence in context: A136825 A136824 A136822 this_sequence A004757 A007527 
               A033894
%Y A120513 Adjacent sequences: A120510 A120511 A120512 this_sequence A120514 A120515 
               A120516
%K A120513 nonn
%O A120513 1,2
%A A120513 Frank Ruskey (http://www.cs.uvic.ca/~ruskey/) and Chris Deugau (deugaucj(AT)uvic.ca), 
               Jun 20 2006