Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147686
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147686 Late-growing permutations: number of permutations of 4 indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations. +0
2
1, 14, 6930, 5223915, 27032968200, 164401445439455, 3627155158988429250, 86733224358763671877835, 5469038805616093755410863500 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A147681.

Sequence in context: A159372 A060856 A030531 this_sequence A048913 A104376 A053870

Adjacent sequences: A147683 A147684 A147685 this_sequence A147687 A147688 A147689

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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research