Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

CROSSREFS

Cf. A147681.

Sequence in context: A143511 A141490 A015379 this_sequence A125572 A017407 A017527

Adjacent sequences: A147711 A147712 A147713 this_sequence A147715 A147716 A147717

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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research