Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147687
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147687 Late-growing permutations: number of permutations of 5 indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations. +0
2
1, 42, 126126, 783353872, 44776592395920, 3611684199828856072, 1267664556730792079292048, 551951935901513814954541886968 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A147681.

Adjacent sequences: A147684 A147685 A147686 this_sequence A147688 A147689 A147690

Sequence in context: A135314 A135425 A028669 this_sequence A152508 A070177 A114786

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 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research