Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147769
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147769 Late-growing permutations: number of permutations of 19 indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations. +0
2
1, 1767263190, 1125718321602329678223000, 155225932761938574730157553835938696696000, 7667961765084109378347562069301502363151989537397618954230000 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A147681.

Sequence in context: A015411 A034649 A158937 this_sequence A129616 A105006 A090874

Adjacent sequences: A147766 A147767 A147768 this_sequence A147770 A147771 A147772

KEYWORD

nonn

AUTHOR

Ron Hardin (rhhardin(AT)att.net) May 01 2009

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research