|
| |
|
|
A095986
|
|
A card-arranging problem: number of permutations p_1, ..., p_n of 1, ..., n such that i + p_i is a square for every i.
|
|
4
| |
|
|
0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 2, 4, 3, 2, 5, 15, 21, 66, 37, 51, 144, 263, 601, 1333, 2119, 2154, 2189, 3280, 12405, 55329, 160895, 588081, 849906, 1258119, 1233262, 2478647, 4305500, 17278636, 47424179, 153686631, 396952852, 1043844982
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,14
|
|
|
COMMENTS
| Gardner attributes the problem (for the case n = 13) to David L. Silverman.
|
|
|
REFERENCES
| M. Gardner, Mathematical Games column, Scientific American, Nov 1974.
M. Gardner, Mathematical Games column, Scientific American, Mar 1975.
M. Gardner, Time Travel and Other Mathematical Bewilderments. Freeman, NY, 1988, p. 81.
|
|
|
FORMULA
| a(n) = permanent(m), where the n-by-n matrix m is defined m(i,j) = 1 or 0, depending on whether i+j is a square or not.
|
|
|
CROSSREFS
| Cf. A006063 (for cubes).
Sequence in context: A152026 A060806 A128868 * A059908 A084936 A099066
Adjacent sequences: A095983 A095984 A095985 * A095987 A095988 A095989
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jul 18 2004
|
|
|
EXTENSIONS
| a(32) and a(33) from John W. Layman (layman(AT)math.vt.edu), Jul 21 2004
a(34)-a(36) from Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 26 2004
More terms from William Rex Marshall (w.r.marshall(AT)actrix.co.nz), Apr 18 2006
|
| |
|
|
