A162897 a(1)=a(2)=2. a(n) = the smallest integer >= 2 such that a(n-1)^a(n) > a(n-2)^a(n-1).

2, 2, 3, 2, 4, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 30, 30, 31, 31, 32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 37, 37, 38

Offset

1,1

Comments

a(2n-1) = a(2n) = n, for all n >= 4.

Links

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

Prog

(PARI) getnew(va, n) = {my(x = 2, y = va[n-2]^va[n-1]); while (va[n-1]^x <= y, x++); x; }
lista(nn) = {my(va = vector(nn)); va[1] = 2; va[2] = 2; for (n=3, nn, va[n] = getnew(va, n); ); va; } \\ Michel Marcus, Sep 05 2019

Crossrefs

Cf. A162898.

Sequence in context: A304117 A326790 A232479 * A364236 A356276 A286532

Adjacent sequences: A162894 A162895 A162896 * A162898 A162899 A162900

Keyword

easy,nonn

Author

Leroy Quet, Jul 16 2009

Status

approved