Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147695
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147695 Late-growing permutations: number of permutations of 8 indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations. +0
2
1, 1430, 1051723530, 4206489449301315, 351597937025844947295000, 73839261438738554611424321993670 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A147681.

Sequence in context: A060364 A124087 A064305 this_sequence A151996 A114083 A127491

Adjacent sequences: A147692 A147693 A147694 this_sequence A147696 A147697 A147698

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 6 13:45 EST 2009. Contains 170429 sequences.


AT&T Labs Research