Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147698
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147698 Late-growing permutations: number of permutations of 10 indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations. +0
2
1, 16796, 504636071940, 159752979289765273698, 1789294251011628021153241548800, 74651909129454094524656449803220566122458 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A147681.

Sequence in context: A034820 A053074 A115923 this_sequence A067493 A016925 A016985

Adjacent sequences: A147695 A147696 A147697 this_sequence A147699 A147700 A147701

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research