A363257 a(n) = floor( ((a(n-1) + 1) / 2)^2 ) + 1 for n >= 1, with a(0) = 0.

0, 1, 2, 3, 5, 10, 31, 257, 16642, 69247363, 1198799355237125, 359279973529237254190922184970, 32270524844792355518177347536627638351478874995525184567711

Offset

0,3

Comments

Iterated application of A033638, with a shift.

Links

Andrew Howroyd, Table of n, a(n) for n = 0..16

A. V. Aho and N. J. A. Sloane, Some doubly exponential sequences, Fibonacci Quarterly, Vol. 11, No. 4 (1973), pp. 429-437.

A. V. Aho and N. J. A. Sloane, Some doubly exponential sequences, Fibonacci Quarterly, Vol. 11, No. 4 (1973), pp. 429-437 (original plus references that F.Q. forgot to include - see last page!)

Formula

a(n) = A033638(a(n-1)+1) for n > 0.

log a(n) ~ C * 2^n for some constant C.

Prog

(PARI) a(n) = if(n < 1, 0, floor( ((a(n-1) + 1) / 2)^2 ) + 1) \\ Andrew Howroyd, Jan 01 2024

Crossrefs

Cf. A003095, A006894, A014980, A033638.

Sequence in context: A330333 A003182 A348260 * A344347 A134294 A154956

Adjacent sequences: A363254 A363255 A363256 * A363258 A363259 A363260

Keyword

nonn

Author

Harry Richman, May 23 2023

Status

approved