Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147692
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147692 Late-growing permutations: number of permutations of 6 indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations. +0
2
1, 132, 2450448, 129141898872, 82881380383401600, 90695437030756958966384, 515544601327354412382720479328 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A147681.

Sequence in context: A146522 A146545 A114534 this_sequence A028674 A003915 A046439

Adjacent sequences: A147689 A147690 A147691 this_sequence A147693 A147694 A147695

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