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-2 of 2 results.

A181331 Number of 0's in the top rows of all 2-compositions of n.

Original entry on oeis.org

0, 1, 5, 23, 99, 408, 1632, 6388, 24596, 93488, 351664, 1311536, 4856432, 17873408, 65436544, 238480960, 865665600, 3131196672, 11290210560, 40594476800, 145588087552, 520933746688, 1860059009024, 6628828632064, 23582036472832
Offset: 0

Views

Author

Emeric Deutsch, Oct 13 2010

Keywords

Comments

A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.

Examples

			a(2)=5 because in (0/2), (1/1), (2,0), (1,0/0,1), (0,1/1,0), (1,1/0,0), and (0,0/1,1) (the 2-compositions are written as (top row / bottom row)) we have 1+0+1+1+1+0+2=5 zeros.
		

Crossrefs

Programs

  • Maple
    g := z*(1-z)^3/(1-4*z+2*z^2)^2: gser := series(g, z = 0, 30): seq(coeff(gser, z, n), n = 0 .. 27);
  • Mathematica
    LinearRecurrence[{8, -20, 16, -4}, {0, 1, 5, 23, 99}, 25] (* Georg Fischer, Feb 01 2021 *)

Formula

a(n) = Sum_{k=0..n} A181330(n,k).
a(n) = (1/2)*A181294(n).
G.f.: x*(1 - x)^3 / (1 - 4*x + 2*x^2)^2.
a(n) = A181292(n)-2*A181292(n-1)+A181292(n-2). - R. J. Mathar, Jul 24 2022

A181293 Triangle read by rows: T(n,k) is the number of 2-compositions of n having k 0's (0<=k<=n) A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.

Original entry on oeis.org

1, 0, 2, 1, 2, 4, 2, 6, 8, 8, 4, 14, 24, 24, 16, 8, 32, 64, 80, 64, 32, 16, 72, 164, 240, 240, 160, 64, 32, 160, 408, 680, 800, 672, 384, 128, 64, 352, 992, 1848, 2480, 2464, 1792, 896, 256, 128, 768, 2368, 4864, 7296, 8288, 7168, 4608, 2048, 512, 256, 1664, 5568
Offset: 0

Views

Author

Emeric Deutsch, Oct 12 2010

Keywords

Comments

The sum of entries in row n is A003480(n).
Sum_{k=0..n} k*T(n,k) = A181294(n).

Examples

			T(2,0)=1, T(2,1)=2, T(2,2)=4 because the 2-compositions of 2, written as (top row/bottom row), are (1/1), (0/2), (2/0), (1,0/0,1), (0,1/1,0), (1,1/0,0), (0,0/1,1).
Triangle starts:
1;
0,2;
1,2,4;
2,6,8,8;
4,14,24,24,16;
...
		

Crossrefs

Programs

  • Maple
    G := (1-z)^2/(1-2*z-2*t*z+2*t*z^2): Gser := simplify(series(G, z = 0, 14)): for n from 0 to 10 do P[n] := sort(coeff(Gser, z, n)) end do: for n from 0 to 10 do seq(coeff(P[n], t, k), k = 0 .. n) end do; # yields sequence in triangular form

Formula

G.f.: G(t,z) = (1-z)^2/(1-2*z-2*t*z+2*t*z^2).
G.f. of column k is 2^k*z^k*(1-z)^{k+2}/(1-2*z)^{k+1} (we have a Riordan array).
Showing 1-2 of 2 results.