The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A102186 The PDO(n) function (Partitions with Designated summands in which all parts are Odd): the sum of products of multiplicities of parts in all partitions of n into odd parts. 7

%I

%S 1,1,2,4,5,8,12,16,22,32,42,56,76,98,128,168,213,272,348,436,548,688,

%T 852,1056,1308,1603,1964,2404,2920,3544,4296,5176,6230,7488,8958,

%U 10704,12772,15182,18024,21368,25254,29808,35136,41308,48504,56880,66552,77776

%N The PDO(n) function (Partitions with Designated summands in which all parts are Odd): the sum of products of multiplicities of parts in all partitions of n into odd parts.

%H Seiichi Manyama, <a href="/A102186/b102186.txt">Table of n, a(n) for n = 0..10000</a> (terms 0..1000 from Alois P. Heinz)

%H G. E. Andrews, R. P. Lewis, J. Lovejoy, <a href="http://dx.doi.org/10.4064/aa105-1-5">Partitions with designated summands</a>, Acta Arith. 105 (2002), no. 1, 51-66.

%H Nayandeep Deka Baruah and Kanan Kumari Ojah, <a href="https://www.emis.de/journals/INTEGERS/papers/p9/p9.Abstract.html">Partitions with designated summands in which all parts are odd</a>, INTEGERS 15 (2015), #A9.

%F Euler transform of period 12 sequence [1, 1, 2, 0, 1, 0, 1, 0, 2, 1, 1, 0, ...].

%F a(n) ~ 5^(1/4) * exp(sqrt(5*n)*Pi/3) / (2^(5/2)*sqrt(3)*n^(3/4)). - _Vaclav Kotesovec_, Nov 28 2015

%F G.f.: Product_{k>=1} (1 + Sum_{j>=1} j * x^(j*(2*k - 1))). - _Ilya Gutkovskiy_, Nov 06 2019

%e a(8)=22 because in the six partitions of 8 into odd parts, namely, 71,53,5111,3311,311111,11111111, the multiplicities of the parts are (1,1),(1,1),(1,3),(2,2),(1,5),(8) with products 1,1,3,4,5,8, having sum 22.

%p b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,

%p b(n, i-2) +add(b(n-i*j, i-2)*j, j=1..n/i)))

%p end:

%p a:= n-> b(n, iquo(1+n,2)*2-1):

%p seq(a(n), n=0..50); # _Alois P. Heinz_, Feb 26 2013

%t b[n_, i_] := b[n, i] = If[n == 0, 1, If[i < 1, 0, b[n, i - 2] + Sum[b[n - i*j, i - 2]*j, {j, 1, n/i}]]]; a[n_] := b[n, Quotient[1 + n, 2]*2 - 1]; Table[a[n], {n, 0, 50}] (* _Jean-François Alcover_, Jan 24 2014, after _Alois P. Heinz_ *)

%t nmax=60; CoefficientList[Series[Product[(1-x^(4*k)) * (1+x^(3*k)) / ((1-x^k) * (1+x^(6*k))), {k,1,nmax}], {x,0,nmax}], x] (* _Vaclav Kotesovec_, Nov 28 2015 *)

%t Table[Total[l = Tally /@ Select[IntegerPartitions@n, VectorQ[#, OddQ] &];

%t Table[x = l[[i]]; Product[x[[j, 2]], {j, Length[x]}], {i, Length[l]}]], {n, 0, 47}] (* _Robert Price_, Jun 08 2020 *)

%o (PARI) {a(n)=local(A); if(n<0, 0, A=x*O(x^n); polcoeff( eta(x^4+A)*eta(x^6+A)^2/ eta(x+A)/eta(x^3+A)/eta(x^12+A), n))} /* _Michael Somos_, Jul 30 2006 */

%Y Cf. A077285 (partitions with designated summands).

%K easy,nonn

%O 0,3

%A _Vladeta Jovovic_, Feb 16 2005

%E More terms from _Emeric Deutsch_, Mar 28 2005

%E Name expanded by _N. J. A. Sloane_, Nov 21 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 25 16:03 EDT 2021. Contains 346291 sequences. (Running on oeis4.)