cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A276422 Triangle read by rows: T(n,k) is the number of partitions of n for which the sum of its odd singletons is k (0<=k<=n). A singleton in a partition is a part that occurs exactly once.

Original entry on oeis.org

1, 0, 1, 2, 0, 0, 1, 1, 0, 1, 4, 0, 0, 0, 1, 2, 2, 0, 2, 0, 1, 8, 0, 0, 1, 1, 0, 1, 4, 4, 0, 4, 0, 2, 0, 1, 14, 0, 0, 2, 2, 1, 1, 0, 2, 9, 6, 0, 7, 0, 4, 0, 2, 0, 2, 24, 1, 0, 4, 3, 2, 2, 1, 3, 0, 2, 16, 10, 0, 12, 0, 8, 0, 4, 1, 3, 0, 2, 41, 1, 0, 7, 5, 4, 4, 2, 6, 1, 3, 0, 3, 28, 16, 0, 20, 0, 14, 0, 8, 2, 6, 1, 3, 0, 3
Offset: 0

Views

Author

Emeric Deutsch, Sep 14 2016

Keywords

Comments

T(n,0) = A265256(n).
T(n,n) = A000700(n).
Sum(k*T(n,k), k>=0) = A276423(n).
Sum(T(n,k), k>=0) = A000041(n).

Examples

			Row 4 is 4, 0, 0, 0, 1 because in the partitions [1,1,1,1], [1,1,2], [2,2], [1,3], [4] the sums of the odd singletons are 0, 0, 0, 4, 0, respectively.
Row 5 is 2, 2, 0, 2, 0, 1 because in the partitions [1,1,1,1,1], [1,1,1,2], [1,2,2], [1,1,3], [2,3], [1,4], [5] the sums of the odd singletons are 0, 0, 1, 3, 3, 1, 5, respectively.
Triangle starts:
1;
0,1;
2,0,0;
1,1,0,1;
4,0,0,0,1;
2,2,0,2,0,1.

Links

Crossrefs

Cf. A000041, A000700, A265256, A276423, A276424, A276425.

Programs

  • Maple
    g := Product(((1-x^(2*j-1))*(1+t^(2*j-1)*x^(2*j-1))+x^(4*j-2))/(1-x^j), j = 1 .. 100): gser := simplify(series(g, x = 0, 23)): for n from 0 to 20 do P[n] := sort(coeff(gser, x, n)) end do: for n from 0 to 20 do seq(coeff(P[n], t, i), i = 0 .. n) end do; # yields sequence in triangular form
# second Maple program:
b:= proc(n, i) option remember; expand(
      `if`(n=0, 1, `if`(i<1, 0, add(b(n-i*j, i-1)*
      `if`(j=1 and i::odd, x^i, 1), j=0..n/i))))
    end:
T:= n-> (p-> seq(coeff(p, x, i), i=0..n))(b(n$2)):
seq(T(n), n=0..14);  # Alois P. Heinz, Sep 14 2016
  • Mathematica
    b[n_, i_] := b[n, i] = Expand[If[n == 0, 1, If[i < 1, 0, Sum[b[n - i*j, i - 1]*If[j == 1 && OddQ[i], x^i, 1], {j, 0, n/i}]]]]; T[n_] := Function[p, Table[Coefficient[p, x, i], {i, 0, n}]][b[n, n]]; Table[T[n], {n, 0, 14}] // Flatten (* Jean-François Alcover, Oct 04 2016, after Alois P. Heinz *)

Formula

G.f.: G(t,x) = Product(((1-x^{2j-1})(1+t^{2j-1}x^{2j-1}) + x^{4j-2})/(1-x^j), j=1..infinity).

A276423 Sum of the odd singletons in all partitions of n (n>=0). A singleton in a partition is a part that occurs exactly once.

Original entry on oeis.org

0, 1, 0, 4, 4, 13, 13, 33, 41, 79, 98, 171, 223, 354, 458, 692, 905, 1306, 1694, 2375, 3077, 4202, 5401, 7238, 9260, 12200, 15495, 20145, 25446, 32686, 41020, 52170, 65117, 82071, 101852, 127374, 157277, 195289, 239915, 296023, 362000, 444063, 540595, 659662
Offset: 0

Views

Author

Emeric Deutsch, Sep 14 2016

Keywords

Examples

			a(4) = 4 because in the partitions [1,1,1,1], [1,1,2], [2,2], [1,3], [4] the sums of the odd singletons are 0,0,0,4,0, respectively; their sum is 4.
a(5) = 13 because in the partitions [1,1,1,1,1], [1,1,1,2], [1,2,2], [1,1,3], [2,3], [1,4], [5] the sums of the odd singletons are 0,0,1,3,3,1,5, respectively; their sum is 13.

Links

Crossrefs

Cf. A103628, A265257, A276422, A276424, A276425.

Programs

  • Maple
    g := x*(1-x+3*x^2+3*x^4-x^5+x^6)/((1-x^4)^2*(product(1-x^i, i = 1..120))): gser := series(g, x = 0, 60); seq(coeff(gser, x, n), n = 0..50);
# second Maple program:
b:= proc(n, i) option remember; `if`(n=0, [1, 0],
      `if`(i<1, 0, add((p-> p+`if`(i::odd and j=1,
      [0, i*p[1]], 0))(b(n-i*j, i-1)), j=0..n/i)))
    end:
a:= n-> b(n$2)[2]:
seq(a(n), n=0..50); # Alois P. Heinz, Sep 14 2016
  • Mathematica
    b[n_, i_] := b[n, i] = If[n == 0, {1, 0}, If[i < 1, 0, Sum[Function[p, p + If[OddQ[i] && j == 1, {0, If[p === 0, 0, i*p[[1]]]}, 0]][b[n-i*j, i-1]], {j, 0, n/i}]]]; a[n_] := b[n, n][[2]]; Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Dec 04 2016 after Alois P. Heinz *)
Table[Total[Select[Flatten[Tally/@IntegerPartitions[n],1],#[[2]]==1 && OddQ[ #[[1]]]&][[All,1]]],{n,0,50}] (* Harvey P. Dale, May 25 2018 *)

Formula

G.f.: g(x) = x*(1-x+3*x^2+3*x^4-x^5+x^6)/((1-x^4)^2*Product_{j>=1} 1-x^j).
a(n) = Sum_{k>=0} k*A276422(n,k).
a(n) ~ 3^(3/2) * exp(Pi*sqrt(2*n/3)) / (16*Pi^2). - Vaclav Kotesovec, Jun 12 2025

A276424 Triangle read by rows: T(n,k) is the number of partitions of n for which the sum of its even singletons is k (0<=k<=n). A singleton in a partition is a part that occurs exactly once.

Original entry on oeis.org

1, 1, 0, 1, 0, 1, 2, 0, 1, 0, 3, 0, 1, 0, 1, 4, 0, 2, 0, 1, 0, 6, 0, 2, 0, 1, 0, 2, 8, 0, 3, 0, 2, 0, 2, 0, 11, 0, 4, 0, 3, 0, 2, 0, 2, 15, 0, 5, 0, 4, 0, 4, 0, 2, 0, 19, 0, 7, 0, 6, 0, 5, 0, 2, 0, 3, 25, 0, 9, 0, 8, 0, 7, 0, 4, 0, 3, 0, 34, 0, 11, 0, 10, 0, 10, 0, 5, 0, 3, 0, 4
Offset: 0

Views

Author

Emeric Deutsch, Sep 14 2016

Keywords

Comments

T(n,0) = A265254(n).
T(n,n) = A035457(n).
Sum_{k>=0} k*T(n,k) = A276425(n).
Sum_{k>=0} T(n,k) = A000041(n).

Examples

			Row 4 is 3, 0, 1, 0, 1 because in the partitions [1,1,1,1], [1,1,2], [2,2], [1,3], [4] the sums of the even singletons are 0, 2, 0, 0, 4, respectively.
Row 5 is 4, 0, 2, 0, 1, 0 because in the partitions [1,1,1,1,1], [1,1,1,2], [1,2,2], [1,1,3], [2,3], [1,4], [5] the sums of the even singletons are 0, 2, 0, 0, 2, 4, 0, respectively.
Triangle starts:
  1;
  1,0;
  1,0,1;
  2,0,1,0;
  3,0,1,0,1;
  4,0,2,0,1,0;
  6,0,2,0,1,0,2.

Links

Crossrefs

Cf. A000041, A035457, A265254, A276422, A276423, A276425.

Programs

  • Maple
    g := Product(((1-x^(2*j))*(1+t^(2*j)*x^(2*j))+x^(4*j))/(1-x^j), j = 1 .. 100): gser := simplify(series(g, x = 0, 23)): for n from 0 to 20 do P[n] := sort(coeff(gser, x, n)) end do: for n from 0 to 20 do seq(coeff(P[n], t, i), i = 0 .. n) end do; # yields sequence in triangular form
# second Maple program:
b:= proc(n, i) option remember; expand(
      `if`(n=0, 1, `if`(i<1, 0, add(b(n-i*j, i-1)*
      `if`(j=1 and i::even, x^i, 1), j=0..n/i))))
    end:
T:= n-> (p-> seq(coeff(p, x, i), i=0..n))(b(n$2)):
seq(T(n), n=0..14);  # Alois P. Heinz, Sep 14 2016
  • Mathematica
    b[n_, i_] := b[n, i] = Expand[If[n == 0, 1, If[i < 1, 0, Sum[b[n - i*j, i - 1]*If[j == 1 && EvenQ[i], x^i, 1], {j, 0, n/i}]]]]; T[n_] := Function[p, Table[Coefficient[p, x, i], {i, 0, n}]][b[n, n]]; Table[T[n], {n, 0, 14}] // Flatten (* Jean-François Alcover, Dec 11 2016, after Alois P. Heinz *)

Formula

G.f.: G(t,x) = Product_{j>=1} ((1-x^(2*j))*(1+t^(2*j)*x^(2*j)) + x^(4*j))/(1-x^j).
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.