Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A019580
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A019580 Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1<=k<=n; sequence gives f(n,4)/n. +0
1
1, 20, 375, 7560, 167825, 4110120 (list; graph; listen)
OFFSET

4,2
CROSSREFS

Cf. A019576.

Sequence in context: A049683 A014901 A000564 this_sequence A084329 A097832 A063815

Adjacent sequences: A019577 A019578 A019579 this_sequence A019581 A019582 A019583

KEYWORD

nonn

AUTHOR

Lee Corbin (lcorbin(AT)tsoft.com)

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 November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.