login
a(n) = min{j : A120510(j) = n}.
2

%I #4 Aug 21 2013 12:12:18

%S 1,5,6,7,12,13,14,15,17,18,19,20,22,23,24,25,31,32,33,34,36,37,38,39,

%T 41,42,43,44,46,47,48,49,52,53,54,55,57,58,59,60,62,63,64,65,67,68,69,

%U 70,73,74

%N a(n) = min{j : A120510(j) = n}.

%H 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 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 g.f.: P(z) = z / (1-z) * (1 + sum(z^(m^4) * (3 + 1 / (1 - z^(m^4))), m=0..infinity))

%p p := proc(n)

%p if n=1 then return 1; end if;

%p for j from p(n-1)+1 to infinity do

%p if A120510(j) = n then return j; fi; od;

%p end proc;

%Y Cf. A120510, A120532.

%K nonn

%O 1,2

%A _Frank Ruskey_ and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006