|
Search: id:A061570
|
|
|
| A061570 |
|
Maximum number of lines in a game of sprouts with n initial dots. |
|
+0
1
|
|
| 0, 1, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 44, 47, 50, 53, 56, 59, 62, 65, 68, 71, 74, 77, 80, 83, 86, 89, 92, 95, 98, 101, 104, 107, 110, 113, 116, 119, 122, 125, 128, 131, 134, 137, 140, 143, 146, 149, 152, 155, 158, 161, 164, 167, 170, 173, 176, 179
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982, see p. 564.
|
|
LINKS
|
D. Purvis, World Game of Sprouts Association
|
|
FORMULA
|
a(1) = 0, a(2) = 1, a(n) = 3n+2 for n >= 3
|
|
CROSSREFS
|
Sequence in context: A122195 A064153 A106670 this_sequence A096679 A101573 A029629
Adjacent sequences: A061567 A061568 A061569 this_sequence A061571 A061572 A061573
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Eric Shafto (eshafto(AT)mac.com), May 18 2001
|
|
|
Search completed in 0.002 seconds
|
