Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

CROSSREFS

Cf. A147681.

Sequence in context: A119887 A124729 A075980 this_sequence A157131 A046323 A017081

Adjacent sequences: A147697 A147698 A147699 this_sequence A147701 A147702 A147703

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