A022629 -id:A022629 - cp's OEIS frontend

A285222 Indices of primes in A022629.

2, 3, 4, 7, 12, 39, 49, 56, 76, 91, 216, 221, 235, 272, 277, 331, 345, 362, 385, 655, 686, 749, 1023, 1591, 1742, 1825, 1836, 1911, 2179, 2511, 2638, 2951, 3004, 3327, 3692, 4743, 4868, 5546, 5658, 5997, 6032, 7867, 8261, 8620, 8811, 13762, 13950, 14150

Offset: 1

Vaclav Kotesovec, Apr 14 2017

nonn

			12 is in the sequence because A022629(12) = 463 is prime.

Vaclav Kotesovec, Table of n, a(n) for n = 1..245

Cf. A022629, A035359.

A304043 Numbers k such that A022629(k) is divisible by k.

Original entry on oeis.org

1, 2, 5, 8, 28, 34, 50, 529, 1082, 1888, 42000, 112230, 178219

Offset: 1

Vaclav Kotesovec, May 05 2018

No other terms below 1000000.

			50 is in the sequence because A022629(50) = 206309050 = 4126181 * 50.

Cf. A022629, A051177, A056848, A304028, A304040.

A067568 Numbers n such that A000009(n) divides A022629(n).

Original entry on oeis.org

0, 1, 2, 5, 9, 11, 15

Offset: 1

Naohiro Nomoto, Jan 30 2002

Next term > 10^4. - Joerg Arndt, Oct 14 2014

Next term, if it exists, is greater than 1000000. - Vaclav Kotesovec, May 05 2018

N=1002;  q='q+O('q^N);
t1=Vec(prod(m=1,N,1+q^m)); \\ A000009
t2=Vec(prod(m=1,N,1+m*q^m)); \\ A022629
for(k=1,N, if(t2[k]%t1[k]==0,print1(k-1,", ")) );
\\ Joerg Arndt, Oct 14 2014

A006906 a(n) is the sum of products of terms in all partitions of n.

Original entry on oeis.org

1, 1, 3, 6, 14, 25, 56, 97, 198, 354, 672, 1170, 2207, 3762, 6786, 11675, 20524, 34636, 60258, 100580, 171894, 285820, 480497, 791316, 1321346, 2156830, 3557353, 5783660, 9452658, 15250216, 24771526, 39713788, 64011924, 102199026, 163583054, 259745051

Offset: 0

Simon Plouffe

a(0) = 1 since the only partition of 0 is the empty partition. The product of its terms is the empty product, namely 1.

Same parity as A000009. - Jon Perry, Feb 12 2004

			Partitions of 0 are {()} whose products are {1} whose sum is 1.
Partitions of 1 are {(1)} whose products are {1} whose sum is 1.
Partitions of 2 are {(2),(1,1)} whose products are {2,1} whose sum is 3.
Partitions of 3 are 3 => {(3),(2,1),(1,1,1)} whose products are {3,2,1} whose sum is 6.
Partitions of 4 are {(4),(3,1),(2,2),(2,1,1),(1,1,1,1)} whose products are {4,3,4,2,1} whose sum is 14.

G. Labelle, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Alois P. Heinz, Table of n, a(n) for n = 0..6000 (first 1001 terms from T. D. Noe)
Atreya Chatterjee, Emergent gravity from patterns in natural numbers, arXiv:2006.01170 [gr-qc], 2020.
Dean Hickerson, Comments on A006906
Robert Schneider and Andrew V. Sills, The product of parts or 'norm' of a partition, #A13 INTEGERS 20A (2020), Theorem 7, p. 4.

Row sums of A118851.

Cf. A000041, A007870, A022629, A022661, A022693, A077335, A163318, A265758, A302830, A318127, A322364, A322365.

a006906 n = p 1 n 1 where
   p _ 0 s = s
   p k m s | mReinhard Zumkeller, Dec 07 2011

A006906 := proc(n)
    option remember;
    if n = 0 then
        1;
    else
        add( A078308(k)*procname(n-k),k=1..n)/n ;
    end if;
end proc: # R. J. Mathar, Dec 14 2011
# second Maple program:
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
       b(n, i-1) +add(b(n-i*j, i-1)*(i^j), j=1..n/i)))
    end:
a:= n-> b(n, n):
seq(a(n), n=0..40);  # Alois P. Heinz, Feb 25 2013

(* a[n,k]=sum of products of partitions of n into parts <= k *) a[0,0]=1; a[n_,0]:=0; a[n_,k_]:=If[k>n, a[n,n], a[n,k] = a[n,k-1] + k a[n-k,k] ]; a[n_]:=a[n,n] (* Dean Hickerson, Aug 19 2007 *)
Table[Total[Times@@@IntegerPartitions[n]],{n,0,35}] (* Harvey P. Dale, Jan 14 2013 *)
nmax = 40; CoefficientList[Series[Product[1/(1 - k*x^k), {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Dec 15 2015 *)
nmax = 40; CoefficientList[Series[Exp[Sum[PolyLog[-j, x^j]/j, {j, 1, nmax}]], {x, 0, nmax}], x] (* Vaclav Kotesovec, Dec 15 2015 *)

The limit of a(n+3)/a(n) is 3. However, the limit of a(n+1)/a(n) does not exist. In fact, the sequence {a(n+1)/a(n)} has three limit points, which are about 1.4422447, 1.4422491 and 1.4422549. (See the Links entry.) - Dean Hickerson, Aug 19 2007
a(n) ~ c(n mod 3) 3^(n/3), where c(0)=97923.26765718877..., c(1)=97922.93936857030... and c(2)=97922.90546334208... - Dean Hickerson, Aug 19 2007
G.f.: 1 / Product_{k>=1} (1-k*x^k).
G.f.: 1 + Sum_{n>=1} n*x^n / Product_{k=1..n} (1-k*x^k) = 1 + Sum_{n>=1} n*x^n / Product_{k>=n} (1-k*x^k). - Joerg Arndt, Mar 23 2011
a(n) = (1/n)*Sum_{k=1..n} A078308(k)*a(n-k). - Vladeta Jovovic, Nov 22 2002
O.g.f.: exp( Sum_{n>=1} Sum_{k>=1} k^n * x^(n*k) / n ). - Paul D. Hanna, Sep 18 2017
O.g.f.: exp( Sum_{n>=1} Sum_{k=1..n} A008292(n,k)*x^(n*k)/(n*(1-x^n)^(n+1)) ), where A008292 is the Eulerian numbers. - Paul D. Hanna, Sep 18 2017

More terms from Vladeta Jovovic, Oct 04 2001

Edited by N. J. A. Sloane, May 19 2007

A015723 Number of parts in all partitions of n into distinct parts.

Original entry on oeis.org

1, 1, 3, 3, 5, 8, 10, 13, 18, 25, 30, 40, 49, 63, 80, 98, 119, 149, 179, 218, 266, 318, 380, 455, 541, 640, 760, 895, 1050, 1234, 1442, 1679, 1960, 2272, 2635, 3052, 3520, 4054, 4669, 5359, 6142, 7035, 8037, 9170, 10460, 11896, 13517, 15349, 17394, 19691

Offset: 1

Clark Kimberling

nonn

			The strict integer partitions of 6 are {(6), (5,1), (4,2), (3,2,1)} with a total of 1 + 2 + 2 + 3 = 8 parts, so a(6) = 8. - _Gus Wiseman_, May 09 2019

Alois P. Heinz, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
Martin Klazar, What is an answer? — remarks, results and problems on PIO formulas in combinatorial enumeration, part I, arXiv:1808.08449 [math.CO], 2018.
Arnold Knopfmacher, and Neville Robbins, Identities for the total number of parts in partitions of integers, Util. Math. 67 (2005), 9-18.
Mircea Merca, Combinatorial interpretations of a recent convolution for the number of divisors of a positive integer, Journal of Number Theory, Volume 160, March 2016, Pages 60-75. See s(n).
Eric Weisstein's World of Mathematics, q-Polygamma Function, q-Pochhammer Symbol.

Cf. A006128, A008289, A079499, A067619, A186545.
Column k=1 of: A210485, A213177, A327622.
Row lengths of A325537.
Cf. A022629, A066186, A066189, A325504, A325505, A325506, A325513, A325515.

b:= proc(n, i) option remember; `if`(n=0, [1, 0], `if`(i<1, [0, 0],
      add((l->[l[1], l[2]+l[1]*j])(b(n-i*j, i-1)), j=0..min(n/i, 1))))
    end:
a:= n-> b(n, n)[2]:
seq(a(n), n=1..50);  # Alois P. Heinz, Feb 27 2013

nn=50; Rest[CoefficientList[Series[D[Product[1+y x^i,{i,1,nn}],y]/.y->1,{x,0,nn}],x]]  (* Geoffrey Critzer, Oct 29 2012; fixed by Vaclav Kotesovec, Apr 16 2016 *)
q[n_, k_] := q[n, k] = If[nVaclav Kotesovec, Apr 16 2016 *)
Table[Length[Join@@Select[IntegerPartitions[n],UnsameQ@@#&]],{n,1,50}] (* Gus Wiseman, May 09 2019 *)
b[n_, i_] := b[n, i] = If[n == 0, {1, 0}, If[i<1, {0, 0},
   Sum[{#[[1]], #[[2]] + #[[1]]*j}&@ b[n-i*j, i-1], {j, 0, Min[n/i, 1]}]]];
a[n_] := b[n, n][[2]];
Array[a, 50] (* Jean-François Alcover, May 21 2021, after Alois P. Heinz *)

N=66;  q='q+O('q^N); gf=sum(n=0,N, n*q^(n*(n+1)/2) / prod(k=1,n, 1-q^k ) );
Vec(gf) /* Joerg Arndt, Oct 20 2012 */

G.f.: sum(k>=1, x^k/(1+x^k) ) * prod(m>=1, 1+x^m ). Convolution of A048272 and A000009. - Vladeta Jovovic, Nov 26 2002
G.f.: sum(k>=1, k*x^(k*(k+1)/2)/prod(i=1..k, 1-x^i ) ). - Vladeta Jovovic, Sep 21 2005
a(n) = A238131(n)+A238132(n) = sum_{k=1..n} A048272(k)*A000009(n-k). - Mircea Merca, Feb 26 2014
a(n) = Sum_{k>=1} k*A008289(n,k). - Vaclav Kotesovec, Apr 16 2016
G.f.: -(-1; x)inf * (log(1-x) + psi_x(1 - log(-1)/log(x)))/(2*log(x)), where psi_q(z) is the q-digamma function, (a; q)_inf is the q-Pochhammer symbol, log(-1) = i*Pi. - _Vladimir Reshetnikov, Nov 21 2016
a(n) ~ 3^(1/4) * log(2) * exp(Pi*sqrt(n/3)) / (2 * Pi * n^(1/4)). - Vaclav Kotesovec, May 19 2018
For n > 0, a(n) = A116676(n) + A116680(n). - Vaclav Kotesovec, May 26 2018

Extended and corrected by Naohiro Nomoto, Feb 24 2002

A304961 Expansion of Product_{k>=1} (1 + 2^(k-1)*x^k).

Original entry on oeis.org

1, 1, 2, 6, 12, 32, 72, 176, 384, 960, 2112, 4992, 11264, 26112, 58368, 136192, 301056, 688128, 1548288, 3489792, 7766016, 17596416, 38993920, 87293952, 194248704, 432537600, 957349888, 2132803584, 4699717632, 10406068224, 23001563136, 50683969536, 111434268672, 245819768832

Offset: 0

Ilya Gutkovskiy, May 22 2018

nonn

Number of compositions of partitions of n into distinct parts. a(3) = 6: 3, 21, 12, 111, 2|1, 11|1. - Alois P. Heinz, Sep 16 2019
Also the number of ways to split a composition of n into contiguous subsequences with strictly decreasing sums. - Gus Wiseman, Jul 13 2020
This sequence is obtained from the generalized Euler transform in A266964 by taking f(n) = -1, g(n) = (-1) * 2^(n-1). - Seiichi Manyama, Aug 22 2020

			From _Gus Wiseman_, Jul 13 2020: (Start)
The a(0) = 1 through a(4) = 12 splittings:
  ()  (1)  (2)    (3)        (4)
           (1,1)  (1,2)      (1,3)
                  (2,1)      (2,2)
                  (1,1,1)    (3,1)
                  (2),(1)    (1,1,2)
                  (1,1),(1)  (1,2,1)
                             (2,1,1)
                             (3),(1)
                             (1,1,1,1)
                             (1,2),(1)
                             (2,1),(1)
                             (1,1,1),(1)
(End)

Cf. A000009, A011782, A022629, A098407, A102866, A266964, A271619, A279785.
The non-strict version is A075900.
Starting with a reversed partition gives A323583.
Starting with a partition gives A336134.
Partitions of partitions are A001970.
Splittings with equal sums are A074854.
Splittings of compositions are A133494.
Splittings with distinct sums are A336127.
Cf. A006951, A063834, A316245, A317715, A319794, A323582, A336135, A336136.

nmax = 33; CoefficientList[Series[Product[(1 + 2^(k - 1) x^k), {k, 1, nmax}], {x, 0, nmax}], x]

N=40; x='x+O('x^N); Vec(prod(k=1, N, 1+2^(k-1)*x^k)) \\ Seiichi Manyama, Aug 22 2020

G.f.: Product_{k>=1} (1 + A011782(k)*x^k).

a(n) ~ 2^n * exp(2*sqrt(-polylog(2, -1/2)*n)) * (-polylog(2, -1/2))^(1/4) / (sqrt(6*Pi) * n^(3/4)). - Vaclav Kotesovec, Sep 19 2019

A066189 Sum of all partitions of n into distinct parts.

Original entry on oeis.org

0, 1, 2, 6, 8, 15, 24, 35, 48, 72, 100, 132, 180, 234, 308, 405, 512, 646, 828, 1026, 1280, 1596, 1958, 2392, 2928, 3550, 4290, 5184, 6216, 7424, 8880, 10540, 12480, 14784, 17408, 20475, 24048, 28120, 32832, 38298, 44520, 51660, 59892, 69230, 79904

Offset: 0

Wouter Meeussen, Dec 15 2001

			The strict integer partitions of 6 are {(6), (5,1), (4,2), (3,2,1)} with sum 6+5+1+4+2+3+2+1 = 24. - _Gus Wiseman_, May 09 2019

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

Row sums of A026793, A118457, A246688, A325537.

Cf. A015723, A022629, A066186, A147655, A325504, A325505, A325506, A325513, A325515, A325537.

b:= proc(n, i) option remember; `if`(n=0, [1, 0], `if`(i>n, [0$2],
      b(n, i+1)+(p-> p+[0, i*p[1]])(b(n-i, i+1))))
    end:
a:= n-> b(n, 1)[2]:
seq(a(n), n=0..80);  # Alois P. Heinz, Sep 01 2014

PartitionsQ[ Range[ 60 ] ]Range[ 60 ]
nmax=60; CoefficientList[Series[x*D[Product[1+x^k, {k, 1, nmax}], x], {x, 0, nmax}], x] (* Vaclav Kotesovec, Nov 21 2016 *)

G.f.: sum(n>=1, n*q^(n-1)/(1+q^n) ) * prod(n>=1, 1+q^n ). - Joerg Arndt, Aug 03 2011
a(n) = n * A000009(n). - Vaclav Kotesovec, Sep 25 2016
G.f.: x*f'(x), where f(x) = Product_{k>=1} (1 + x^k). - Vaclav Kotesovec, Nov 21 2016
a(n) = A056239(A325506(n)). - Gus Wiseman, May 09 2019

A297321 Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of Product_{j>=1} (1 + j*x^j)^k.

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 3, 5, 5, 0, 1, 4, 9, 14, 7, 0, 1, 5, 14, 28, 28, 15, 0, 1, 6, 20, 48, 69, 64, 25, 0, 1, 7, 27, 75, 137, 174, 133, 43, 0, 1, 8, 35, 110, 240, 380, 413, 266, 64, 0, 1, 9, 44, 154, 387, 726, 998, 933, 513, 120, 0, 1, 10, 54, 208, 588, 1266, 2075, 2488, 2046, 1000, 186, 0

Offset: 0

Ilya Gutkovskiy, Dec 28 2017

			G.f. of column k: A_k(x) = 1 + k*x + (1/2)*k*(k + 3)*x^2 + (1/6)*k*(k^2 + 9*k + 20)*x^3 + (1/24)*k*(k^3 + 18*k^2 + 107*k + 42)*x^4 + (1/120)*k*(k^4 + 30*k^3 + 335*k^2 + 810*k + 624)*x^5 + ...
Square array begins:
1,   1,   1,    1,    1,    1,  ...
0,   1,   2,    3,    4,    5,  ...
0,   2,   5,    9,   14,   20,  ...
0,   5,  14,   28,   48,   75,  ...
0,   7,  28,   69,  137,  240,  ...
0,  15,  64,  174,  380,  726,  ...

G. C. Greubel, Table of n, a(n) for the first 100 antidiagonals, flattened

Columns k=0..32 give A000007, A022629, A022630, A022631, A022632, A022633, A022634, A022635, A022636, A022637, A022638, A022639, A022640, A022641, A022642, A022643, A022644, A022645, A022646, A022647, A022648, A022649, A022650, A022651, A022652, A022653, A022654, A022655, A022656, A022657, A022658, A022659, A022660.
Main diagonal gives A297322.
Antidiagonal sums give A299164.
Cf. A266891, A297323, A297325, A297328.

Table[Function[k, SeriesCoefficient[Product[(1 + i x^i)^k, {i, 1, n}], {x, 0, n}]][j - n], {j, 0, 11}, {n, 0, j}] // Flatten

G.f. of column k: Product_{j>=1} (1 + j*x^j)^k.

A147655 a(n) is the coefficient of x^n in the polynomial given by Product_{k>=1} (1 + prime(k)*x^k).

Original entry on oeis.org

1, 2, 3, 11, 17, 40, 86, 153, 283, 547, 1069, 1737, 3238, 5340, 9574, 17251, 27897, 45845, 78601, 126725, 207153, 353435, 550422, 881454, 1393870, 2239938, 3473133, 5546789, 8762663, 13341967, 20676253, 31774563, 48248485, 74174759, 111904363, 170184798

Offset: 0

Neil Fernandez, Nov 09 2008

nonn

Sum of all squarefree numbers whose prime indices sum to n. A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. - Gus Wiseman, May 09 2019

			Form a product from the primes: (1 + 2*x) * (1 + 3*x^2) * (1 + 5*x^3) * ...* (1 + prime(n)*x^n) * ... Multiplying out gives 1 + 2*x + 3*x^2 + 11*x^3 + ..., so the sequence begins 1, 2, 3, 11, ....
From _Petros Hadjicostas_, Apr 10 2020: (Start)
Let f(m) = prime(m). Using the strict partitions of n (see A000009), we get:
a(1) = f(1) = 2,
a(2) = f(2) = 3,
a(3) = f(3) + f(1)*f(2) = 5 + 2*3 = 11,
a(4) = f(4) + f(1)*f(3) = 7 + 2*5 = 17,
a(5) = f(5) + f(1)*f(4) + f(2)*f(3) = 11 + 2*7 + 3*5 = 40,
a(6) = f(6) + f(1)*f(5) + f(2)*f(4) + f(1)*f(2)*f(3) = 13 + 2*11 + 3*7 + 2*3*5 = 86,
a(7) = f(7) + f(1)*f(6) + f(2)*f(5) + f(3)*f(4) + f(1)*f(2)*f(4) = 17 + 2*13 + 3*11 + 5*7 + 2*3*7 = 153. (End)

Alois P. Heinz, Table of n, a(n) for n = 0..9000 (first 1001 terms from Harvey P. Dale)

Row sums of A246867 and A258323.

Cf. A000009,A005117, A015723, A022629, A056239, A066189, A112798, A145519, A147541, A325504, A325506, A325537.

b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
      b(n, i-1) +`if`(i>n, 0, b(n-i, i-1)*ithprime(i))))
    end:
a:= n-> b(n$2):
seq(a(n), n=0..50);  # Alois P. Heinz, Sep 05 2014

nn=40;Take[Rest[CoefficientList[Expand[Times@@Table[1+Prime[n]x^n,{n,nn}]],x]],nn] (* Harvey P. Dale, Jul 01 2012 *)

a(n) = [x^n] Product_{k>=1} 1+prime(k)*x^k. - Alois P. Heinz, Sep 05 2014

a(n) = Sum_{(b_1,...,b_n)} f(1)^b_1 * f(2)^b_2 * ... * f(n)^b_n, where f(m) = prime(m), and the sum is taken over all lists (b_1,...,b_n) with b_j in {0,1} and Sum_{j=1..n} j*b_j = n. - Petros Hadjicostas, Apr 10 2020

More terms from Harvey P. Dale, Jul 01 2012
a(0)=1 inserted by Alois P. Heinz, Sep 05 2014
Name edited by Petros Hadjicostas, Apr 10 2020

A022661 Expansion of Product_{m>=1} (1-m*q^m).

Original entry on oeis.org

1, -1, -2, -1, -1, 5, 1, 13, 4, 0, 2, -8, -61, -31, 13, -156, 21, 11, 223, 92, 91, 426, 972, 165, 141, -1126, 440, 1294, -4684, -2755, -5748, -2414, -6679, 10511, -10048, -19369, 19635, 22629, 14027, 76969, -1990, 40193, -10678, 75795, 215767, -54322, -40882

Offset: 0

N. J. A. Sloane

sign

Is a(9) the only occurrence of 0 in this sequence? - Robert Israel, Jun 02 2015

Robert Israel, Table of n, a(n) for n = 0..10000

Cf. A006906, A022629, A022693, A266964.

Coefficients(&*[(1-m*x^m):m in [1..40]])[1..40] where x is PolynomialRing(Integers()).1; // G. C. Greubel, Feb 18 2018

P:= mul(1-m*q^m,m=1..100):
S:= series(P,q,101):
seq(coeff(S,q,j),j=0..100); # Robert Israel, Jun 02 2015
# second Maple program:
b:= proc(n, i) option remember; `if`(i*(i+1)/2n, 0, i*b(n-i, i-1))))
    end:
a:= n-> b(n$2):
seq(a(n), n=0..60);  # Sean A. Irvine (after Alois P. Heinz), May 19 2019

nmax = 40; CoefficientList[Series[Product[1 - k*x^k, {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Dec 15 2015 *)
nmax = 40; CoefficientList[Series[Exp[-Sum[PolyLog[-j, x^j]/j, {j, 1, nmax}]], {x, 0, nmax}], x] (* Vaclav Kotesovec, Dec 15 2015 *)
(* More efficient program: *) nmax = 50; poly = ConstantArray[0, nmax+1]; poly[[1]] = 1; poly[[2]] = -1; Do[Do[poly[[j+1]] -= k*poly[[j-k+1]], {j, nmax, k, -1}];, {k, 2, nmax}]; poly (* Vaclav Kotesovec, Jan 07 2016 *)

m=50; q='q+O('q^m); Vec(prod(n=1,m,(1-n*q^n))) \\ G. C. Greubel, Feb 18 2018

cp's OEIS Frontend

A285222 Indices of primes in A022629.

Views

Author

Keywords

Examples

Links

Crossrefs

A304043 Numbers k such that A022629(k) is divisible by k.

Views

Author

Keywords

Comments

Examples

Crossrefs

A067568 Numbers n such that A000009(n) divides A022629(n).

Views

Author

Keywords

Comments

Programs

PARI

A006906 a(n) is the sum of products of terms in all partitions of n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

Formula

Extensions

A015723 Number of parts in all partitions of n into distinct parts.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A304961 Expansion of Product_{k>=1} (1 + 2^(k-1)*x^k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A066189 Sum of all partitions of n into distinct parts.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A297321 Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of Product_{j>=1} (1 + j*x^j)^k.

Views

Author

Keywords

Examples

Links

Crossrefs