A066966 -id:A066966 - cp's OEIS frontend

A066186 Sum of all parts of all partitions of n.

0, 1, 4, 9, 20, 35, 66, 105, 176, 270, 420, 616, 924, 1313, 1890, 2640, 3696, 5049, 6930, 9310, 12540, 16632, 22044, 28865, 37800, 48950, 63336, 81270, 104104, 132385, 168120, 212102, 267168, 334719, 418540, 520905, 647172, 800569, 988570, 1216215, 1493520

Offset: 0

Wouter Meeussen, Dec 15 2001

Sum of the zeroth moments of all partitions of n.
Also the number of one-element transitions from the integer partitions of n to the partitions of n-1 for labeled parts with the assumption that any part z is composed of labeled elements of amount 1, i.e., z = 1_1 + 1_2 + ... + 1_z. Then one can take from z a single element in z different ways. E.g., for n=3 to n=2 we have A066186(3) = 9 and [111] --> [11], [111] --> [11], [111] --> [11], [12] --> [111], [12] --> [111], [12] --> [2], [3] --> 2, [3] --> 2, [3] --> 2. For the unlabeled case, one can take a single element from z in only one way. Then the number of one-element transitions from the integer partitions of n to the partitions of n-1 is given by A000070. E.g., A000070(3) = 4 and for the transition from n=3 to n=2 one has [111] --> [11], [12] --> [11], [12] --> [2], [3] --> [2]. - Thomas Wieder, May 20 2004
Also sum of all parts of all regions of n (Cf. A206437). - Omar E. Pol, Jan 13 2013
From Omar E. Pol, Jan 19 2021: (Start)
Apart from initial zero this is also as follows:
Convolution of A000203 and A000041.
Convolution of A024916 and A002865.
For n >= 1, a(n) is also the number of cells in a symmetric polycube in which the terraces are the symmetric representation of sigma(k), for k = n..1, (cf. A237593) starting from the base and located at the levels A000041(0)..A000041(n-1) respectively. The polycube looks like a symmetric tower (cf. A221529). A dissection is a three-dimensional spiral whose top view is described in A239660. The growth of the volume of the polycube represents each convolution mentioned above. (End)
From Omar E. Pol, Feb 04 2021: (Start)
a(n) is also the sum of all divisors of all positive integers in a sequence with n blocks where the m-th block consists of A000041(n-m) copies of m, with 1 <= m <= n. The mentioned divisors are also all parts of all partitions of n.
Apart from initial zero this is also the convolution of A340793 and A000070. (End)

			a(3)=9 because the partitions of 3 are: 3, 2+1 and 1+1+1; and (3) + (2+1) + (1+1+1) = 9.
a(4)=20 because A000041(4)=5 and 4*5=20.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
F. G. Garvan, Higher-order spt functions, Adv. Math. 228 (2011), no. 1, 241-265, alternate copy. - From _N. J. A. Sloane_, Jan 02 2013
F. G. Garvan, Higher-order spt functions, arXiv:1008.1207 [math.NT], 2010.
T. J. Osler, A. Hassen and T. R. Chandrupatia, Surprising connections between partitions and divisors, The College Mathematics Journal, Vol. 38. No. 4, Sep. 2007, 278-287 (see p. 287).
Omar E. Pol, Illustration of a(10), prism and tower, each polycube contains 420 cubes.
Omar E. Pol, Illustration of initial terms of A066186 and of A139582 (n>=1)

Cf. A000041, A093694, A000070, A132825, A001787 (same for ordered partitions), A277029, A000203, A221529, A237593, A239660.
First differences give A138879. - Omar E. Pol, Aug 16 2013
Row sums of triangles A138785, A181187, A245099, A337209, A339106, A340423, A340424, A221529, A302246, A338156, A340035, A340056, A340057, A346741. - Omar E. Pol, Aug 02 2021

a066186 = sum . concat . ps 1 where
   ps _ 0 = [[]]
   ps i j = [t:ts | t <- [i..j], ts <- ps t (j - t)]
-- Reinhard Zumkeller, Jul 13 2013

with(combinat): a:= n-> n*numbpart(n): seq(a(n), n=0..50); # Zerinvary Lajos, Apr 25 2007

PartitionsP[ Range[0, 60] ] * Range[0, 60]

a(n)=numbpart(n)*n \\ Charles R Greathouse IV, Mar 10 2012

from sympy import npartitions
def A066186(n): return n*npartitions(n) # Chai Wah Wu, Oct 22 2023

[n*Partitions(n).cardinality() for n in range(41)] # Peter Luschny, Jul 29 2014

a(n) = n * A000041(n). - Omar E. Pol, Oct 10 2011
G.f.: x * (d/dx) Product_{k>=1} 1/(1-x^k), i.e., derivative of g.f. for A000041. - Jon Perry, Mar 17 2004 (adjusted to match the offset by Geoffrey Critzer, Nov 29 2014)
Equals A132825 * [1, 2, 3, ...]. - Gary W. Adamson, Sep 02 2007
a(n) = A066967(n) + A066966(n). - Omar E. Pol, Mar 10 2012
a(n) = A207381(n) + A207382(n). - Omar E. Pol, Mar 13 2012
a(n) = A006128(n) + A196087(n). - Omar E. Pol, Apr 22 2012
a(n) = A220909(n)/2. - Omar E. Pol, Jan 13 2013
a(n) = Sum_{k=1..n} A000203(k)*A000041(n-k), n >= 1. - Omar E. Pol, Jan 20 2013
a(n) = Sum_{k=1..n} k*A036043(n,n-k+1). - L. Edson Jeffery, Aug 03 2013
a(n) = Sum_{k=1..n} A024916(k)*A002865(n-k), n >= 1. - Omar E. Pol, Jul 13 2014
a(n) ~ exp(Pi*sqrt(2*n/3))/(4*sqrt(3)) * (1 - (sqrt(3/2)/Pi + Pi/(24*sqrt(6))) / sqrt(n)). - Vaclav Kotesovec, Oct 24 2016
a(n) = Sum_{k=1..n} A340793(k)*A000070(n-k), n >= 1. - Omar E. Pol, Feb 04 2021

a(0) added by Franklin T. Adams-Watters, Jul 28 2014

A066897 Total number of odd parts in all partitions of n.

Original entry on oeis.org

1, 2, 5, 8, 15, 24, 39, 58, 90, 130, 190, 268, 379, 522, 722, 974, 1317, 1754, 2330, 3058, 4010, 5200, 6731, 8642, 11068, 14076, 17864, 22528, 28347, 35490, 44320, 55100, 68355, 84450, 104111, 127898, 156779, 191574, 233625, 284070, 344745, 417292, 504151

Offset: 1

Naohiro Nomoto, Jan 24 2002

Also sum of all odd-indexed parts minus the sum of all even-indexed parts of all partitions of n (Cf. A206563). - Omar E. Pol, Feb 12 2012
Column 1 of A206563. - Omar E. Pol, Feb 15 2012
Suppose that p=[p(1),p(2),p(3),...] is a partition of n with parts in nonincreasing order.  Let f(p) = p(1) - p(2) + p(3) - ... be the alternating sum of parts of p and let F(n) = sum of alternating sums of all partitions of n.  Conjecture: F(n) = A066897(n) for n >= 1. - Clark Kimberling, May 17 2019
From Omar E. Pol, Apr 02 2023: (Start)
Convolution of A000041 and A001227.
Convolution of A002865 and A060831.
a(n) is also the total number of odd divisors of all positive integers in a sequence with n blocks where the m-th block consists of A000041(n-m) copies of m, with 1 <= m <= n. The mentioned odd divisors are also all odd parts of all partitions of n. (End)
a(n) is odd iff n is a term of A067567 (proof: n*p(n) = the sum of the parts in all the partitions of n == the number of odd parts in all partitions of n (mod 2). Hence the number of odd parts in all partitions of n is odd iff n*p(n) is odd, equivalently, iff both n and p(n) are odd). - Peter Bala, Jan 11 2025

			a(4) = 8 because in the partitions of 4, namely [4],[3,1],[2,2],[2,1,1],[1,1,1,1], we have a total of 0+2+0+2+4=8 odd parts.

Vaclav Kotesovec, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Alois P. Heinz)

Cf. A000041, A001227, A001620, A002865, A006128, A060831, A066898, A066966, A066967, A103919, A206563, A207381, A207382, A209423, A338156.

a066897 = p 0 1 where
   p o _             0 = o
   p o k m | m < k     = 0
           | otherwise = p (o + mod k 2) k (m - k) + p o (k + 1) m
-- Reinhard Zumkeller, Mar 09 2012

a066897 = length . filter odd . concat . ps 1 where
   ps _ 0 = [[]]
   ps i j = [t:ts | t <- [i..j], ts <- ps t (j - t)]
-- Reinhard Zumkeller, Jul 13 2013

g:=sum(x^(2*j-1)/(1-x^(2*j-1)),j=1..70)/product(1-x^j,j=1..70): gser:=series(g,x=0,45): seq(coeff(gser,x^n),n=1..44);
# Emeric Deutsch, Mar 13 2006
b:= proc(n, i) option remember; local f, g;
      if n=0 or i=1 then [1, n]
    else f:= b(n, i-1); g:= `if`(i>n, [0, 0], b(n-i, i));
         [f[1]+g[1], f[2]+g[2]+ (i mod 2)*g[1]]
      fi
    end:
a:= n-> b(n, n)[2]:
seq(a(n), n=1..50);
# Alois P. Heinz, Mar 22 2012

f[n_, i_] := Count[Flatten[IntegerPartitions[n]], i]
o[n_] := Sum[f[n, i], {i, 1, n, 2}]
e[n_] := Sum[f[n, i], {i, 2, n, 2}]
Table[o[n], {n, 1, 45}]  (* A066897 *)
Table[e[n], {n, 1, 45}]  (* A066898 *)
%% - %                   (* A209423 *)
(* Clark Kimberling, Mar 08 2012 *)
b[n_, i_] := b[n, i] = Module[{f, g}, If[n==0 || i==1, {1, n}, f = b[n, i-1]; g = If[i>n, {0, 0}, b[n-i, i]]; {f[[1]] + g[[1]], f[[2]] + g[[2]] + Mod[i, 2]*g[[1]]}] ]; a[n_] := b[n, n][[2]]; Table[a[n], {n, 1, 50}] (* Jean-François Alcover, Sep 26 2015, after Alois P. Heinz *)

a(n) = Sum_{k=1..n} b(k)*numbpart(n-k), where b(k)=A001227(k)=number of odd divisors of k and numbpart() is A000041. - Vladeta Jovovic, Jan 26 2002
a(n) = Sum_{k=0..n} k*A103919(n,k). - Emeric Deutsch, Mar 13 2006
G.f.: Sum_{j>=1}(x^(2j-1)/(1-x^(2j-1)))/Product_{j>=1}(1-x^j). - Emeric Deutsch, Mar 13 2006
a(n) = A066898(n) + A209423(n) = A006128(n) - A066898(n). [Reinhard Zumkeller, Mar 09 2012]
a(n) = A207381(n) - A207382(n). - Omar E. Pol, Mar 11 2012
a(n) = (A006128(n) + A209423(n))/2. - Vaclav Kotesovec, May 25 2018
a(n) ~ exp(Pi*sqrt(2*n/3)) * (2*gamma + log(24*n/Pi^2)) / (8*Pi*sqrt(2*n)), where gamma is the Euler-Mascheroni constant A001620. - Vaclav Kotesovec, May 25 2018

More terms from Vladeta Jovovic, Jan 26 2002

A113686 Triangular array T(n,k)=number of partitions of n in which sum of even parts is k, for k=0,1,...n; n>=0.

Original entry on oeis.org

1, 1, 0, 1, 0, 1, 2, 0, 1, 0, 2, 0, 1, 0, 2, 3, 0, 2, 0, 2, 0, 4, 0, 2, 0, 2, 0, 3, 5, 0, 3, 0, 4, 0, 3, 0, 6, 0, 4, 0, 4, 0, 3, 0, 5, 8, 0, 5, 0, 6, 0, 6, 0, 5, 0, 10, 0, 6, 0, 8, 0, 6, 0, 5, 0, 7, 12, 0, 8, 0, 10, 0, 9, 0, 10, 0, 7, 0, 15, 0, 10, 0, 12, 0, 12, 0, 10, 0, 7, 0, 11, 18, 0, 12, 0, 16, 0, 15

Offset: 0

Clark Kimberling, Nov 05 2005

(Sum over row n) = A000041(n) = number of partitions of n. Reversal of this array is array in A113685, except for row 0.

Sum(k*T(n,k),k=0..n)=A066966(n). - Emeric Deutsch, Feb 17 2006

			First 5 rows:
1
1 0
1 0 1
2 0 1 0
2 0 1 0 2
3 0 2 0 2 0.
The partitions of 5 are
5, 1+4, 2+3, 1+1+3, 1+2+2, 1+1+1+2, 1+1+1+1+1;
sums of even parts are 0,4,2,0,4,2, respectively,
so that the numbers of 0's, 1's, 2s, 3s, 4s, 5s
are 0,3,0,2,0,2,0, which is row 5 of the array.

Cf. A000041, A113685.

Cf. A066966.

g:=1/product((1-x^(2*j-1))*(1-t^(2*j)*x^(2*j)),j=1..20): gser:=simplify(series(g,x=0,20)): P[0]:=1: for n from 1 to 13 do P[n]:=coeff(gser,x^n) od: for n from 0 to 13 do seq(coeff(P[n],t,j),j=0..n) od; # yields sequence in triangular form - Emeric Deutsch, Feb 17 2006

G:=1/product((1-x^(2j-1))(1-t^(2j)x^(2j)), j=1..infinity). - Emeric Deutsch, Feb 17 2006

More terms from Emeric Deutsch, Feb 17 2006

A066967 Total sum of odd parts in all partitions of n.

Original entry on oeis.org

1, 2, 7, 10, 23, 36, 65, 94, 160, 230, 356, 502, 743, 1030, 1480, 2006, 2797, 3760, 5120, 6780, 9092, 11902, 15701, 20350, 26508, 34036, 43860, 55822, 71215, 89988, 113792, 142724, 179137, 223230, 278183, 344602, 426687, 525616, 647085, 792950

Offset: 1

Vladeta Jovovic, Jan 26 2002

nonn

Partial sums of A206435. - Omar E. Pol, Mar 17 2012
From Omar E. Pol, Apr 01 2023: (Start)
Convolution of A000041 and A000593.
Convolution of A002865 and A078471.
a(n) is also the sum of all odd divisors of all positive integers in a sequence with n blocks where the m-th block consists of A000041(n-m) copies of m, with 1 <= m <= n. The mentioned odd divisors are also all odd parts of all partitions of n. (End)

			a(4) = 10 because in the partitions of 4, namely [4],[3,1],[2,2],[2,1,1],[1,1,1,1], the total sum of the odd parts is (3+1)+(1+1)+(1+1+1+1) = 10.

Vaclav Kotesovec, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Alois P. Heinz)
George E. Andrews and Mircea Merca, A further look at the sum of the parts with the same parity in the partitions of n, Journal of Combinatorial Theory, Series A, Volume 203, 105849 (2024).

Cf. A000041, A000593, A066897, A066898, A113685, A206435.

Cf. A002865, A078471.

g:=sum((2*i-1)*x^(2*i-1)/(1-x^(2*i-1)),i=1..50)/product(1-x^j,j=1..50): gser:=series(g,x=0,50): seq(coeff(gser,x^n),n=1..47);
# Emeric Deutsch, Feb 19 2006
b:= proc(n, i) option remember; local f, g;
      if n=0 or i=1 then [1, n]
    else f:= b(n, i-1); g:= `if`(i>n, [0, 0], b(n-i, i));
         [f[1]+g[1], f[2]+g[2]+ (i mod 2)*g[1]*i]
      fi
    end:
a:= n-> b(n, n)[2]:
seq (a(n), n=1..50);
# Alois P. Heinz, Mar 22 2012

max = 50; g = Sum[(2*i-1)*x^(2*i-1)/(1-x^(2*i-1)), {i, 1, max}]/Product[1-x^j, {j, 1, max}]; gser = Series[g, {x, 0, max}]; a[n_] := SeriesCoefficient[gser, {x, 0, n}]; Table[a[n], {n, 1, max-1}] (* Jean-François Alcover, Jan 24 2014, after Emeric Deutsch *)
Map[Total[Select[Flatten[IntegerPartitions[#]], OddQ]] &, Range[30]] (* Peter J. C. Moses, Mar 14 2014 *)

a(n) = Sum_{k=1..n} b(k)*numbpart(n-k), where b(k)=A000593(k)=sum of odd divisors of k.
a(n) = sum(k*A113685(n,k), k=0..n). - Emeric Deutsch, Feb 19 2006
G.f.: sum((2i-1)x^(2i-1)/(1-x^(2i-1)), i=1..infinity)/product(1-x^j, j=1..infinity). - Emeric Deutsch, Feb 19 2006
a(n) = A066186(n) - A066966(n). - Omar E. Pol, Mar 10 2012
a(n) ~ exp(Pi*sqrt(2*n/3)) / (8*sqrt(3)). - Vaclav Kotesovec, May 29 2018

More terms from Naohiro Nomoto and Sascha Kurz, Feb 07 2002

A206436 Total sum of even parts in the last section of the set of partitions of n.

Original entry on oeis.org

0, 2, 0, 8, 2, 18, 10, 42, 28, 80, 70, 162, 148, 290, 300, 530, 562, 918, 1020, 1570, 1780, 2602, 3022, 4286, 4992, 6858, 8110, 10872, 12888, 16962, 20178, 26134, 31138, 39728, 47412, 59848, 71312, 89072, 106176, 131440, 156400, 192164, 228330, 278616, 330502

Offset: 1

Omar E. Pol, Feb 12 2012

nonn

Also total sum of even parts in the partitions of n that do not contain 1 as a part.
From Omar E. Pol, Apr 09 2023: (Start)
Convolution of A002865 and A146076.
a(n) is also the total sum of even divisors of the terms in the n-th row of the triangle A336811.
a(n) is also the sum of even terms in the n-th row of the triangle A207378.
a(n) is also the sum of even terms in the n-th row of the triangle A336812. (End)

Vaclav Kotesovec, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Alois P. Heinz)

Partial sums give A066966.

Cf. A002865, A135010, A138121, A138879, A146076, A206433, A206434, A206435, A207378, A336811, A336812.

b:= proc(n, i) option remember; local g, h;
      if n=0 then [1, 0]
    elif i<1 then [0, 0]
    else g:= b(n, i-1); h:= `if`(i>n, [0, 0], b(n-i, i));
         [g[1]+h[1], g[2]+h[2] +((i+1) mod 2)*h[1]*i]
      fi
    end:
a:= n-> b(n, n)[2] -`if`(n=1, 0, b(n-1, n-1)[2]):
seq(a(n), n=1..60);  # Alois P. Heinz, Mar 16 2012

b[n_, i_] := b[n, i] = Module[{g, h}, Which[n == 0, {1, 0}, i < 1, {0, 0}, True, g = b[n, i-1]; h = If[i>n, {0, 0}, b[n-i, i]]; {g[[1]] + h[[1]], g[[2]] + h[[2]] + Mod[i+1, 2]*h[[1]]*i}]]; a[n_] := b[n, n][[2]] - If[n == 1, 0, b[n-1, n-1][[2]]]; Table[a[n], {n, 1, 60}] (* Jean-François Alcover, Feb 16 2017, after Alois P. Heinz *)

G.f.: (Sum_{i>0} 2*i*x^(2*i)*(1-x)/(1-x^(2*i))) / Product_{i>0} (1-x^i). - Alois P. Heinz, Mar 16 2012

a(n) ~ Pi * exp(Pi*sqrt(2*n/3)) / (24*sqrt(2*n)). - Vaclav Kotesovec, May 29 2018

More terms from Alois P. Heinz, Mar 16 2012

A208475 Triangle read by rows: T(n,k) = total sum of odd/even parts >= k in all partitions of n, if k is odd/even.

Original entry on oeis.org

1, 2, 2, 7, 2, 3, 10, 10, 3, 4, 23, 12, 11, 4, 5, 36, 30, 17, 14, 5, 6, 65, 40, 35, 18, 17, 6, 7, 94, 82, 49, 44, 22, 20, 7, 8, 160, 110, 93, 58, 48, 26, 23, 8, 9, 230, 190, 133, 108, 70, 56, 30, 26, 9, 10, 356, 260, 217, 148, 124, 76, 64, 34, 29, 10, 11

Offset: 1

Omar E. Pol, Feb 28 2012

Essentially this sequence is related to A206561 in the same way as A206563 is related to A181187. See the calculation in the example section of A206563.

			Triangle begins:
1;
2,   2;
7,   2,  3;
10, 10,  3,  4;
23, 12, 11,  4,  5;
36, 30, 17, 14,  5,  6;

Alois P. Heinz, Rows n = 1..141, flattened

Column 1-2: A066967, A066966. Right border is A000027.

Cf. A138785, A181187, A206561, A206563, A208476.

p:= (f, g)-> zip((x, y)-> x+y, f, g, 0):
b:= proc(n, i) option remember; local f, g;
      if n=0 then [1]
    elif i=1 then [1, n]
    else f:= b(n, i-1); g:= `if`(i>n, [0], b(n-i, i));
         p (p (f, g), [0$i, g[1]])
      fi
    end:
T:= proc(n) local l;
      l:= b(n, n);
      seq (add (l[i+2*j+1]*(i+2*j), j=0..(n-i)/2), i=1..n)
    end:
seq (T(n), n=1..14);  # Alois P. Heinz, Mar 21 2012

p[f_, g_] := With[{m = Max[Length[f], Length[g]]}, PadRight[f, m, 0] + PadRight[g, m, 0]]; b[n_, i_] := b[n, i] = Module[{f, g}, Which[n == 0, {1}, i == 1, {1, n}, True, f = b[n, i-1]; g = If[i>n, {0}, b[n-i, i]]; p[p[f, g], Append[Array[0&, i], g[[1]]]]]]; T[n_] := Module[{l}, l = b[n, n]; Table[Sum[l[[i+2j+1]]*(i+2j), {j, 0, (n-i)/2}], {i, 1, n}]]; Table[T[n], {n, 1, 14}] // Flatten (* Jean-François Alcover, Mar 11 2015, after Alois P. Heinz *)

More terms from Alois P. Heinz, Mar 21 2012

A208477 Difference between the sum of odd parts and the sum of even parts in all the partitions of n.

Original entry on oeis.org

0, 1, 0, 5, 0, 11, 6, 25, 12, 50, 40, 96, 80, 173, 170, 320, 316, 545, 590, 930, 1020, 1552, 1760, 2537, 2900, 4066, 4736, 6450, 7540, 10045, 11856, 15482, 18280, 23555, 27920, 35461, 42032, 52805, 62662, 77955, 92380, 113963, 135040, 165295, 195540, 237866

Offset: 0

Omar E. Pol, Mar 10 2012

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..1000

Cf. A066186, A209423.

b:= proc(n,i) option remember; local g, h;
      if n=0 then [1, 0]
    elif i<1 then [0, 0]
    else g:= b(n, i-1);
         h:= `if`(i>n, [0, 0], b(n-i, i));
         [g[1]+h[1], g[2]+h[2] +h[1]*i*(2*(i mod 2)-1)]
      fi
    end:
a:= n-> b(n, n)[2]:
seq(a(n), n=0..60); # Alois P. Heinz, Mar 10 2012

Map[Total[Select[#, OddQ]] - Total[Select[#, EvenQ]] &[Flatten[IntegerPartitions[#]]] &, -1 + Range[30]] (* Peter J. C. Moses, Mar 14 2014 *)
max = 60; s = Sum[x^(2i) (x^(2i) - 2i (x-1) - 1)/(x + x^(4i) - (x+1) x^(2i) ), {i, 1, Floor[max/2]}]/QPochhammer[x] + O[x]^max; CoefficientList[s, x] (* Jean-François Alcover, Aug 29 2016, after Alois P. Heinz *)

a(n) = A066967(n) - A066966(n).

G.f.: (Sum_{i>0} (2*i-1)*x^(2*i-1)/(1-x^(2*i-1))-2*i*x^(2*i)/(1-x^(2*i))) / Product_{j>0} (1-x^j). - Alois P. Heinz, Mar 10 2012

More terms from Alois P. Heinz, Mar 10 2012

cp's OEIS Frontend

A066965 Duplicate of A066966.

Views

Author

Keywords

A066186 Sum of all parts of all partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Python

Sage

Formula

Extensions

A066897 Total number of odd parts in all partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Haskell

Maple

Mathematica

Formula

Extensions

A113686 Triangular array T(n,k)=number of partitions of n in which sum of even parts is k, for k=0,1,...n; n>=0.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Formula

Extensions

A066967 Total sum of odd parts in all partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A206436 Total sum of even parts in the last section of the set of partitions of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A208475 Triangle read by rows: T(n,k) = total sum of odd/even parts >= k in all partitions of n, if k is odd/even.

Views

Author

Keywords

Comments

Examples

Links