Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147694
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147694 Late-growing permutations: number of permutations of 7 indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations. +0
2
1, 429, 49884120, 22745605840236, 165850226337286576800, 2500267880518574604245088816, 233099041543988273824859604028713600 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A147681.

Sequence in context: A033279 A145056 A064304 this_sequence A166537 A165058 A165062

Adjacent sequences: A147691 A147692 A147693 this_sequence A147695 A147696 A147697

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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research