Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122693
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122693 Bishops on an n X n board (see Robinson paper for details). +0
2
0, 2, 4, 32, 128, 1152, 6912, 73728, 589824, 7372800, 73728000, 1061683200, 12740198400, 208089907200, 2913258700800, 53271016243200, 852336259891200, 17259809262796800, 310676566730342400, 6903923705118720000, 138078474102374400000, 3341499073277460480000 (list; graph; listen)
OFFSET

0,2

REFERENCES

R. W. Robinson, Counting arrangements of bishops, pp. 198-214 of Combinatorial Mathematics IV (Adelaide 1975), Lect. Notes Math., 560 (1976). (C_{2n+1}, Eq. (20))

MAPLE

C:=proc(n) local k; if n mod 2 = 0 then RETURN(0); fi; k:=(n-1)/2; if k mod 2 = 0 then RETURN( k*2^(k-1)*((k/2)!)^2 ); else RETURN( 2^k*(((k+1)/2)!)^2 ); fi; end; [seq(C(2*n+1), n=0..30)];

CROSSREFS

Sequence in context: A101575 A009098 A133127 this_sequence A019060 A085055 A075070

Adjacent sequences: A122690 A122691 A122692 this_sequence A122694 A122695 A122696

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Sep 25 2006

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 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research