|
| |
|
|
A001527
|
|
2 Sum C(2^n-1,i), i=0..n.
(Formerly M1286 N0493)
|
|
0
| |
|
|
2, 4, 14, 128, 3882, 412736, 151223522, 189581406208, 820064805806914, 12419746847290729472, 668590083306794321516802, 129667782549203712117025325056, 91624448643446654575608517356620802, 238057970008583161105667221977375792447488
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
REFERENCES
| N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. O. Winder, Enumeration of seven-argument threshold functions, IEEE Trans. Electron. Computers, 14 (1965), 315-.
|
|
|
MATHEMATICA
| Table[2*Sum[Binomial[2^n - 1, i], {i, 0, n}], {n, 0, 15}] (* From Harvey P. Dale, Mar 27 2011 *)
|
|
|
CROSSREFS
| Equals 2 * A046855.
Sequence in context: A102449 A193520 A102897 * A067209 A134040 A061291
Adjacent sequences: A001524 A001525 A001526 * A001528 A001529 A001530
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
