|
|
A073587
|
|
a(n) = a(n-1)*2^n + 1 where a(0)=1.
|
|
6
|
|
|
1, 3, 13, 105, 1681, 53793, 3442753, 440672385, 112812130561, 57759810847233, 59146046307566593, 121131102837896382465, 496152997224023582576641, 4064485353259201188467843073, 66592528027798752271857140908033, 2182103958414909514444214793274425345
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Also, number of nodes in an n-ary tree with increasing fanout as the level increases. - Dhruv Matani, Apr 12 2012
|
|
LINKS
|
|
|
FORMULA
|
a(n) = floor(D*2^(n*(n+1)/2)) where D is a constant, D=1.64163256065515386629... = Sum_{k>=0} 1/2^(k(k+1)/2) = A299998. - Benoit Cloitre, Sep 01 2002
|
|
MATHEMATICA
|
a = 1; Table[a = a*2^n + 1, {n, 14}] (* Jayanta Basu, Jul 02 2013 *)
|
|
PROG
|
(UBASIC)
25 A=1
30 for I=1 to 20
40 A=A*2^I+1
50 print A
60 next
70 end
|
|
CROSSREFS
|
Cf. A000225 (nodes in a binary tree).
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|