Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074141
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074141 Sum of products of parts increased by 1 in all partitions of n. +0
12
1, 2, 7, 18, 50, 118, 301, 684, 1621, 3620, 8193, 17846, 39359, 84198, 181313, 383208, 811546, 1695062, 3546634, 7341288, 15207022, 31261006, 64255264, 131317012, 268336125, 545858260, 1110092387, 2250057282, 4558875555 (list; graph; listen)
OFFSET

0,2

COMMENT

Replace each term in A036035 by the number of its divisors; sequence gives sum of terms in n-th group.

FORMULA

G.f.: 1/Product_{m>0} (1-(m+1)*x^m). Recurrence: a(n) = 1/n*Sum_{k=1..n} b(k)*a(n-k), where b(k) = Sum_{d divides k} d*(d+1)^(k/d).

EXAMPLE

The partitions of 4 are 4, 3+1, 2+2, 2+1+1, 1+1+1+1, the corresponding products when parts are increased by 1 are 5,8,9,12,16 and their sum is a(4) = 50.

CROSSREFS

Cf. A036035, A074139, A074140, A006906.

Sequence in context: A022726 A017925 A030236 this_sequence A122931 A094976 A006869

Adjacent sequences: A074138 A074139 A074140 this_sequence A074142 A074143 A074144

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 28 2002

EXTENSIONS

More terms from Alford Arnold (Alford1940(AT)aol.com), Sep 17 2002. More terms, better description and formulas from Vladeta Jovovic, Vladimir Baltic (vladeta(AT)eunet.rs), Nov 28 2002

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research