A100937 -id:A100937 - cp's OEIS frontend

A051163 Sequence is defined by property that (a0,a1,a2,a3,...) = binomial transform of (a0,a0,a1,a1,a2,a2,a3,a3,...).

1, 2, 5, 12, 30, 76, 194, 496, 1269, 3250, 8337, 21428, 55184, 142376, 367916, 952000, 2466014, 6393372, 16586678, 43054344, 111801908, 290412296, 754543052, 1960808160, 5096293794, 13247503540, 34440553562, 89549255592, 232868582328, 605646682144

Offset: 0

Jonas Wallgren

Equals the self-convolution of A027826. Also equals antidiagonal sums of symmetric square array A100936. - Paul D. Hanna, Nov 22 2004

Equals eigensequence of triangle A152198. - Gary W. Adamson, Nov 28 2008

Alois P. Heinz, Table of n, a(n) for n = 0..1000
N. J. A. Sloane, Transforms

Cf. A051164, A051165, A051166, A027826, A100936, A100937, A152198.

a:= proc(n) option remember; add(`if`(k<2, 1,
      a(iquo(k, 2)))*binomial(n, k), k=0..n)
    end:
seq(a(n), n=0..40);  # Alois P. Heinz, Jul 08 2015

a[n_] := a[n] = 1 + Sum[Binomial[k, j]*Binomial[n-k, j]*a[j], {k, 1, n}, {j, 0, n-k}]; Table[a[n], {n, 0, 40}] (* Jean-François Alcover, Nov 11 2015 *)

a(n)=1+sum(k=1,n,sum(j=0,n-k,binomial(k,j)*binomial(n-k,j)*a(j)))

a(n)=local(A,m); if(n<0,0,m=1; A=1+O(x); while(m<=n,m*=2; A=subst(A,x,(x/(1-x))^2)/(1-x)); polcoeff(A^2,n))
for(n=0,40,print1(a(n),", ")) \\ Paul D. Hanna, Nov 22 2004

a(n) = 1 + Sum_{k=1..n} Sum_{j=0..n-k} C(k, j)*C(n-k, j)*a(j). - Paul D. Hanna, Nov 22 2004
G.f. A(x) satisfies: A(x) = A(x^2/(1-x)^2)/(1-x)^2 and A(x^2) = A(x/(1+x))/(1+x)^2. - Paul D. Hanna, Nov 22 2004
a(0) = 1; a(n) = Sum_{k=0..floor(n/2)} binomial(n+1,2*k+1) * a(k). - Ilya Gutkovskiy, Apr 07 2022

More terms from Vladeta Jovovic, Jul 26 2002

A100936 Symmetric square array, read by antidiagonals, where the inverse binomial transform of row n equals: [C(n,0)1, C(n,1)2,..., C(n,k)A051163(k), ..., C(n,n)A051163(n)] and where A051162 equals the antidiagonal sums.

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 1, 5, 5, 1, 1, 7, 14, 7, 1, 1, 9, 28, 28, 9, 1, 1, 11, 47, 76, 47, 11, 1, 1, 13, 71, 163, 163, 71, 13, 1, 1, 15, 100, 301, 435, 301, 100, 15, 1, 1, 17, 134, 502, 971, 971, 502, 134, 17, 1, 1, 19, 173, 778, 1909, 2577, 1909, 778, 173, 19, 1, 1, 21, 217, 1141

Offset: 0

Paul D. Hanna, Nov 23 2004

Antidiagonal sums form A051163. Main diagonal is A100937. Different from A086620.

			Rows begin:
[1,1,1,1,1,1,1,1,1,...],
[1,3,5,7,9,11,13,15,17,...],
[1,5,14,28,47,71,100,134,...],
[1,7,28,76,163,301,502,778,...],
[1,9,47,163,435,971,1909,3417,...],
[1,11,71,301,971,2577,5917,12167,...],
[1,13,100,502,1909,5917,15678,36744,...],
[1,15,134,778,3417,12167,36744,97272,...],...
Antidiagonal sums form A051163: [1,2,5,12,30,76,194,496,1269,3250,8337,...].
The inverse binomial transform of the rows form the respective rows of the triangle B:
[1*1],
[1*1,1*2],
[1*1,2*2,1*5],
[1*1,3*2,3*5,1*12],
[1*1,4*2,6*5,4*12,1*30],...
where B(n,k) = binomial(n,k)*A051163(k).

Cf. A051163, A100937.

T(n,k)=if(n==0 || k==0,1, sum(j=0,n,binomial(k,j)*binomial(n,j)*sum(i=0,j,T(j-i,i)));)

T(n, k) = Sum_{j=0..n} C(k, j)*C(n, j)*A051162(j), with T(0, 0) = 1 and where Sum_{i=0..n} T(n-i, i) = A051162(n).

cp's OEIS Frontend

A051163 Sequence is defined by property that (a0,a1,a2,a3,...) = binomial transform of (a0,a0,a1,a1,a2,a2,a3,a3,...).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

Extensions

A100936 Symmetric square array, read by antidiagonals, where the inverse binomial transform of row n equals: [C(n,0)1, C(n,1)2,..., C(n,k)A051163(k), ..., C(n,n)A051163(n)] and where A051162 equals the antidiagonal sums.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula

cp's OEIS Frontend

A051163 Sequence is defined by property that (a0,a1,a2,a3,...) = binomial transform of (a0,a0,a1,a1,a2,a2,a3,a3,...).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

Extensions

A100936 Symmetric square array, read by antidiagonals, where the inverse binomial transform of row n equals: [C(n,0)*1, C(n,1)*2,..., C(n,k)*A051163(k), ..., C(n,n)*A051163(n)] and where A051162 equals the antidiagonal sums.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula

A100936 Symmetric square array, read by antidiagonals, where the inverse binomial transform of row n equals: [C(n,0)1, C(n,1)2,..., C(n,k)A051163(k), ..., C(n,n)A051163(n)] and where A051162 equals the antidiagonal sums.