The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A120520 a(n) = min{j : A120509(j) = n}. 2

%I

%S 1,4,5,6,10,11,12,13,15,16,17,18,20,21,22,23,28,29,30,31,33,34,35,36,

%T 38,39,40,41,43,44,45,46,49,50,51,52,54,55,56,57,59,60,61,62,64,65,66,

%U 67,70,71

%N a(n) = min{j : A120509(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) * (2 + 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 A120509(j) = n then return j; fi; od;

%p end proc;

%Y Cf. A120509, A120531.

%K nonn

%O 1,2

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 6 18:59 EDT 2020. Contains 334832 sequences. (Running on oeis4.)