|
Search: id:A007901
|
|
|
| A007901 |
|
Number of minimal unavoidable n-celled pebbling configurations. |
|
+0
1
|
|
| 0, 0, 0, 0, 4, 22, 98, 412, 1700, 6974, 28576, 117146, 480722, 1974914, 8122084, 33435390, 137757480, 567998152, 2343472004, 9674252070, 39956606552, 165099840920, 682446679582, 2821858504062, 11671572244666
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
REFERENCES
|
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 6.50.
|
|
LINKS
|
F. R. K. Chung, R. L. Graham, J. A. Morrison and A. M. Odlyzko, Pebbling a chessboard, Amer. Math. Monthly 102 (1995), pp. 113-123.
Google Labs, Google Labs congratulations puzzle
Marcus Kazmierczak, Google Labs Puzzles, Jul 29, 2004.
Slashdot (CmdrTaco), Google's Math Puzzle, Thu Sep 16, 2004.
|
|
FORMULA
|
There is an explicit generating function.
|
|
MAPLE
|
The Maple snippet provides an alternative solution to the Google congratulations puzzle at http://www.7427466391.com. After running the Maple code, f(1) to f(4) match the puzzle, with f(5) being 1510865746 and f(6) being 6171783928.
Digits:=2000: E:=evalf(exp(1)): g:=n->trunc((E-(10^(-n)*trunc(E*10^n)))*10^(10+n)): h:=[0, 0, 0, 0, 4, 22, 98, 412, 1700]: f:=k->g(h[k+3]):
|
|
CROSSREFS
|
Sequence in context: A036922 A036926 A079272 this_sequence A088581 A017970 A099013
Adjacent sequences: A007898 A007899 A007900 this_sequence A007902 A007903 A007904
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
odlyzko(AT)dtc.umn.edu (A. M. Odlyzko)
|
|
|
Search completed in 0.005 seconds
|
