A120514 a(n) = min{j : A120503(j) = n}.

1, 2, 3, 5, 6, 7, 9, 10, 11, 14, 15, 16, 18, 19, 20, 22, 23, 24, 27, 28, 29, 31, 32, 33, 35, 36, 37, 41, 42, 43, 45, 46, 47, 49, 50, 51, 54, 55, 56, 58, 59, 60, 62, 63, 64, 67, 68, 69, 71, 72, 73, 75, 76, 77, 81, 82, 83, 85, 86, 87, 89, 90, 91, 94, 95, 96, 98

Offset

1,2

Links

Table of n, a(n) for n=1..67.

Benoit Cloitre, 3^13 steps of the walk using step: turn 90° right if a(n)is even and turn 90° left if a(n) is odd

C. Deugau and F. Ruskey, Complete k-ary Trees and Generalized Meta-Fibonacci Sequences, J. Integer Seq., Vol. 12. [This is a later version than that in the GenMetaFib.html link]

C. Deugau and F. Ruskey, Complete k-ary Trees and Generalized Meta-Fibonacci Sequences

Formula

G.f.: P(z) = z / (1-z) * (1 + Sum_{m>=0} z^(m^3)/(1 - z^(m^3))).

a(1) = 1; a(n) = n-1 + a(floor((n-1)/3)+1). - Gleb Ivanov, Jan 10 2022

Maple

p := proc(n)
if n=1 then return 1; end if;
for j from p(n-1)+1 to infinity do
if A120503(j) = n then return j; fi; od;
end proc;

Crossrefs

Cf. A120503, A120525, A005187.

Sequence in context: A325113 A328393 A189529 * A101886 A284509 A135674

Adjacent sequences: A120511 A120512 A120513 * A120515 A120516 A120517

Keyword

nonn

Author

Frank Ruskey and Chris Deugau (deugaucj(AT)uvic.ca), Jun 20 2006

Status

approved