Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147715
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147715 Late-growing permutations: number of permutations of 17 indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations. +0
6
1, 129644790, 1914992149823954412750, 3118154713099658349261989389351453752, 1091385182415179567904447175900607727196876211756373000 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A147681.

Sequence in context: A115301 A036341 A059092 this_sequence A011577 A017001 A017073

Adjacent sequences: A147712 A147713 A147714 this_sequence A147716 A147717 A147718

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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research