|
|
A000799
|
|
a(n) = floor(2^n / n).
(Formerly M0239 N0082)
|
|
22
|
|
|
2, 2, 2, 4, 6, 10, 18, 32, 56, 102, 186, 341, 630, 1170, 2184, 4096, 7710, 14563, 27594, 52428, 99864, 190650, 364722, 699050, 1342177, 2581110, 4971026, 9586980, 18512790, 35791394, 69273666, 134217728, 260301048, 505290270, 981706810, 1908874353
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,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).
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) a(n)=1<<n\n
(Python) for n in range(1, 40): print(int(2**n / n), end=", ") # Stefano Spezia, Oct 20 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|