Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147682
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147682 Late-growing permutations: number of permutations of 2 indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations. +0
2
1, 2, 30, 403, 18720, 746192, 71892912, 5873837638, 951265850580, 133244998049858, 32484245570649180, 6956417433946216990, 2375465385671586163800 (list; graph; listen)
OFFSET

1,2
CROSSREFS

Cf. A147681.

Sequence in context: A152277 A083446 A091345 this_sequence A077517 A060042 A134362

Adjacent sequences: A147679 A147680 A147681 this_sequence A147683 A147684 A147685

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

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.