Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A019578
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A019578 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,3)/n. +0
1
1, 12, 160, 2450, 43050, 858480, 19208000 (list; graph; listen)
OFFSET

3,2
CROSSREFS

Cf. A019576.

Sequence in context: A112719 A091019 A098400 this_sequence A144346 A167558 A048609

Adjacent sequences: A019575 A019576 A019577 this_sequence A019579 A019580 A019581

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 December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research

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