Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002465
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002465 Number of placements of 2n-2 nonattacking bishops on an n X n board.
(Formerly M3616 N1467)
+0
1
1, 4, 26, 260, 3368, 53744, 1022320, 22522960, 565532992, 15915225216 (list; graph; listen)
OFFSET

1,2

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

W. Ahrens, Mathematische Unterhaltungen und Spiele. Teubner, Leipzig, Vol. 1, 3rd ed., 1921; Vol. 2, 2nd ed., 1918. See Vol. 1, p. 271.

LINKS

W. Ahrens, Mathematische Unterhaltungen und Spiele, Leipzig: B. G. Teubner, 1901.

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

D. Atkinson, Solution to the n-Bishops problem of trying to place n identical bishops on an n x n chessboard.

CROSSREFS

Sequence in context: A056786 A006056 A098620 this_sequence A079473 A145164 A113078

Adjacent sequences: A002462 A002463 A002464 this_sequence A002466 A002467 A002468

KEYWORD

nonn,nice,more

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Nov 20 2006

Definition corrected. - Max Alekseyev (maxale(AT)gmail.com), Oct 18 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research