|
Search: id:A006788
|
|
|
| A006788 |
|
Floor( 2^(n-1)/n ).
(Formerly M0712)
|
|
+0
3
|
|
| 1, 1, 1, 2, 3, 5, 9, 16, 28, 51, 93, 170, 315, 585, 1092, 2048, 3855, 7281, 13797, 26214, 49932, 95325, 182361, 349525, 671088, 1290555, 2485513, 4793490, 9256395, 17895697, 34636833, 67108864, 130150524, 252645135, 490853405, 954437176, 1857283155, 3616814565
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
This is the number of nested polygons needed to produce a graph that is always concave, see the MathWorld article. - Jon Perry (perry(AT)globalnet.co.uk), Sep 15 2002
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
MathWorld, Happy End Problem
|
|
CROSSREFS
|
Cf. A054650, A000048.
Sequence in context: A056303 A000048 A074099 this_sequence A054650 A022857 A000691
Adjacent sequences: A006785 A006786 A006787 this_sequence A006789 A006790 A006791
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
