cp's OEIS Frontend

A120518 a(n) = min{j : A120507(j) = n}.

%I A120518 #12 Jul 13 2025 14:06:36
%S A120518 1,2,3,4,6,7,8,9,11,12,13,14,16,17,18,19,22,23,24,25,27,28,29,30,32,
%T A120518 33,34,35,37,38,39,40,43,44,45,46,48,49,50,51,53,54,55,56,58,59,60,61,
%U A120518 64,65,66,67,69,70,71,72,74,75,76,77,79,80,81,82,86,87,88,89,91,92
%N A120518 a(n) = min{j : A120507(j) = n}.
%H A120518 C. Deugau and F. Ruskey, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL12/Ruskey/ruskey6.html">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 A120518 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 A120518 G.f.: z / (1-z) * (1 + sum(z^(m^4) * (1 / (1 - z^(m^4))), m=0..infinity)).
%F A120518 a(1) = 1; a(n) = n-1 + a(floor((n-1)/4)+1). - _Gleb Ivanov_, Jan 12 2022
%p A120518 A120518 := proc(n)
%p A120518     for j from 1 do
%p A120518         if A120507(j) = n then
%p A120518             return j ;
%p A120518         end if;
%p A120518     end do:
%p A120518 end proc:
%p A120518 seq(A120518(n),n=1..70) ;
%Y A120518 Cf. A120507, A120529.
%K A120518 nonn
%O A120518 1,2
%A A120518 _Frank Ruskey_ and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006