Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107107
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107107 For each partition of n, calculate (dM2/dM3) where dM2 = A036039(p) and dM3 = A036040(p); then sum over all partitions of n. +0
3
1, 1, 2, 4, 11, 37, 168, 926, 6181, 47651, 418546, 4106264, 44537519, 528408261, 6807428748, 94588717554, 1409927483625, 22437711255279, 379674820846534, 6806486383431340, 128862216628864163, 2569080120361323721 (list; graph; listen)
OFFSET

0,3

COMMENT

Values for individual partitions (A107106) are factorials when all but one part of the partition has size one or two, but not usually in other cases.

FORMULA

For partition [<c_i^k_i>], the contribution to the sum is product_i (c_i - 1)!^k_i.

G.f.: 1/Product_{m>0} (1-(m-1)!*x^m). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 10 2007

EXAMPLE

For n = 6,

(120,144,90,40,90,120,15,40,45,15,1) / (1,6,15,10,15,60,15,20,45,15,1)

equals (120,24,6,4,6,2,1,2,1,1,1) so A107107(6) = 168

CROSSREFS

Cf. A000142, A036039, A000110, A036040, A107106, A102189.

Cf. A077365.

Sequence in context: A035098 A138301 A118182 this_sequence A101898 A065851 A013044

Adjacent sequences: A107104 A107105 A107106 this_sequence A107108 A107109 A107110

KEYWORD

easy,nonn

AUTHOR

Alford Arnold (Alford1940(AT)aol.com), May 12 2005

EXTENSIONS

Edited, corrected and extended by Frank Adams-Watters (FrankTAW(AT)netscape.net), Nov 3 2005

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 10 2007

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research