Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057599
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057599 (n^2)!/(n!)^(n+1); number of ways of dividing n^2 labeled items into n unlabeled boxes of n items each. +0
5
1, 1, 3, 280, 2627625, 5194672859376, 3708580189773818399040, 1461034854396267778567973305958400, 450538787986875167583433232345723106006796340625 (list; graph; listen)
OFFSET

0,3

COMMENT

Note that if n=p^k for p prime then a(n) is coprime to n (i.e. a(n) is not divisible by p)

FORMULA

a(n)=A034841(n)/A000142(n)

EXAMPLE

a(2)=3 since the possibilities are {{0,1},{2,3}}; {{0,2},{1,3}}; and {{0,3},{1,2}}.

CROSSREFS

Sequence in context: A003706 A068250 A096126 this_sequence A054583 A139984 A057631

Adjacent sequences: A057596 A057597 A057598 this_sequence A057600 A057601 A057602

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Oct 06 2000

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research