Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

CROSSREFS

Cf. A147681.

Sequence in context: A124515 A075009 A103936 this_sequence A123322 A147575 A046326

Adjacent sequences: A147710 A147711 A147712 this_sequence A147714 A147715 A147716

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research