|
| |
|
|
A059153
|
|
a(n) = 2^(n+2)*(2^(n+1)-1).
|
|
6
| |
|
|
4, 24, 112, 480, 1984, 8064, 32512, 130560, 523264, 2095104, 8384512, 33546240, 134201344, 536838144, 2147418112, 8589803520, 34359476224, 137438429184, 549754765312, 2199021158400, 8796088827904, 35184363700224, 140737471578112
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| A hierarchical sequence (S(W'2{2}c) - see A059126).
a(n) written in base 2: 100, 11000, 1110000, ..., i.e. (n+1) times 1 and (n+2) times 0 (see A163663). [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Aug 12 2009]
a(n) = A173787(2*n+3,n+2); cf. A020522, A006516. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 28 2010]
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=0,...,200
J. Wallgren, Hierarchical sequences
|
|
|
PROG
| (PARI) { for (n = 0, 200, write("b059153.txt", n, " ", 2^(n + 2)*(2^(n + 1) - 1)); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 25 2009]
|
|
|
CROSSREFS
| Equals A045687(2n+4).
Sequence in context: A166036 A120908 A145655 * A129032 A099582 A037132
Adjacent sequences: A059150 A059151 A059152 * A059154 A059155 A059156
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Jonas Wallgren (jonwa(AT)ida.liu.se), Feb 02 2001
|
|
|
EXTENSIONS
| Revised by Henry Bottomley (se16(AT)btinternet.com), Jun 27 2005
|
| |
|
|
