Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #8 Nov 27 2018 09:34:34
%S 1,4,8,9,14,15,17,18,24,25,27,28,31,32,34,35,42,43,45,46,49,50,52,53,
%T 57,58,60,61,64,65,67,68,76,77,79,80,83,84,86,87,91,92,94,95,98,99,
%U 101,102,107,108
%N a(n) = min{j : A120501(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>
%H B. Jackson and F. Ruskey, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v13i1r26">Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes</a>, Electronic Journal of Combinatorics, 13 (2006), #R26, 13 pages.
%F g.f.: P(z) = z / (1-z) * (1 + sum(z^(m^2) * (2 + 1 / (1 - z^(m^2))), 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 A120501(j) = n then return j; fi; od;
%p end proc;
%Y Cf. A120501, A120523.
%K nonn
%O 1,2
%A _Frank Ruskey_ and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006