|
| |
|
|
A164632
|
|
a(1)=1 followed by 2^k appearing 2^(2*k-1) times for k>0.
|
|
3
| |
|
|
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; 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
| Contribution from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 17 2010: (Start)
(Other) Haskell:
a164632_list = [1] ++ (concat $ rep 1)
.............. where rep n = (replicate (2^(2*n-1)) (2^n)) : rep (n+1)
a164632 n = a164632_list !! (n-1)
-- eop. (End)
|
|
|
CROSSREFS
| Cf. A000079, A004171, A081294, A053644.
Sequence in context: A063511 A164717 A164715 * A063095 A156726 A082852
Adjacent sequences: A164629 A164630 A164631 * A164633 A164634 A164635
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 23 2009
|
|
|
EXTENSIONS
| Typo in formula fixed by Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 16 2010
|
| |
|
|
