Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A103650
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A103650 G.f.: x^2/((1-x^2)^2*Product_{i>0}(1-x^i)). +0
1
0, 1, 1, 4, 5, 12, 16, 31, 42, 72, 98, 155, 210, 315, 423, 610, 812, 1136, 1498, 2047, 2674, 3585, 4642, 6125, 7865, 10240, 13046, 16791, 21237, 27060, 33993, 42933, 53591, 67155, 83332, 103687, 127956, 158196, 194217, 238720, 291663, 356582 (list; graph; listen)
OFFSET

1,4

COMMENT

Let pi be a partition of n and b(pi,k) = Sum p, where p runs over all distinct parts p of pi whose multiplicities are >=k. Let T(n,k) = Sum b(pi,k), when pi runs over all partitions pi of n. G.f. for T(n,k) is x^k/((1-x^k)^2*Product_{i>0}(1-x^i)). a(n) = T(n,2).

EXAMPLE

Partitions of 4 are [1, 1, 1, 1], [1, 1, 2], [2, 2], [1, 3], [4] and a(4) = 1 + 1 + 2 + 0 + 0 = 4.

MATHEMATICA

Drop[ CoefficientList[ Series[ x^2/((1 - x^2)^2*Product[(1 - x^i), {i, 50}]), {x, 0, 42}], x], 1] (from Robert G. Wilson v Mar 29 2005)

CROSSREFS

Cf. A014153.

Sequence in context: A050022 A137619 A115375 this_sequence A131116 A131328 A054451

Adjacent sequences: A103647 A103648 A103649 this_sequence A103651 A103652 A103653

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 26 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 29 2005

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