A164632 - OEIS

A164632

a(1)=1 followed by 2^k appearing 2^(2*k-1) times for k>0.

1, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Occured when analyzing A056753 to construct a recurrence.

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = f(n,1,1) with f(x,y,z) = if x=1 then z else if y=1 then f(x-1,2*z*z,2*z) else f(x-1,y-1,z).

PROG

(Haskell)

a164632 n = a164632_list !! (n-1)