|
Search: id:A166444
|
|
|
| A166444 |
|
a(0) = 0, a(1) = 1 and for n > 1, a(n) = sum of all previous terms. |
|
+0
3
|
|
| 0, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824, 2147483648
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Essentially a duplicate of A000079. - N. J. A. Slaone, Oct 15 2009
|
|
FORMULA
|
a(n) = A000079(n-1) for n > 0.
|
|
MATHEMATICA
|
a[0] = 0; a[1] = 1; a[n_] := a[n] = Plus @@ Array[a, n - 1]; Array[a, 35, 0]
|
|
CROSSREFS
|
Cf. A131577, A034008, A011782. Cf. A000045, A000213, A000288, A000322, A000383, A060455, A123526, A127193, A127194, A127624, A163551.
Sequence in context: A123344 A131577 A141531 this_sequence A084633 A122803 A000079
Adjacent sequences: A166441 A166442 A166443 this_sequence A166445 A166446 A166447
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 13 2009
|
|
|
Search completed in 0.002 seconds
|
