Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

CROSSREFS

Cf. A147681.

Sequence in context: A101701 A092011 A072679 this_sequence A015376 A072760 A069175

Adjacent sequences: A147702 A147703 A147704 this_sequence A147706 A147707 A147708

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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research