A138112 -id:A138112 - cp's OEIS frontend

A138110 Table T(d,n) read column by column: the n-th term in the sequence of the d-th differences of A138112, d=0..4.

0, 0, 0, 1, -1, 0, 0, 1, 0, -1, 0, 1, 1, -1, -1, 1, 2, 0, -2, -1, 3, 2, -2, -3, 0, 5, 0, -5, -3, 3, 5, -5, -8, 0, 8, 0, -13, -8, 8, 13, -13, -21, 0, 21, 13, -34, -21, 21, 34, 0, -55, 0, 55, 34, -34, -55, 55, 89, 0, -89, 0, 144, 89, -89, -144, 144, 233, 0, -233, -144, 377, 233, -233, -377, 0, 610, 0, -610, -377, 377

Offset: 0

Paul Curtz, May 04 2008

Ignoring signs, the sequence contains A000045(2)=1 ten times and each of the following Fibonacci numbers A000045(i>2) four times.

			All 5 rows of the table T(d,n) are:
.0,.0,.0,.1,.3,.5,.5,..0,-13,-34,-55,-55,...0,.144,...
.0,.0,.1,.2,.2,.0,-5,-13,-21,-21,..0,.55,.144,.233,...
.0,.1,.1,.0,-2,-5,-8,.-8,..0,.21,.55,.89,..89,...0,...
.1,.0,-1,-2,-3,-3,.0,..8,.21,.34,.34,..0,.-89,-233,...
-1,-1,-1,-1,.0,.3,.8,.13,.13,..0,-34,-89,-144,-144,...

Cf. A102312 (A049666), A099100, A134489, A134490, A134491.

T(0,n)=A138112(n). T(d,n)= T(d-1,n+1)-T(d-1,n), d=1..4.
T(1,n)=A100334(n-1). T(2,n)=A103311(n). T(3,n) = -A138003(n-2). T(4,n)= -A105371(n).
sum_(d=0..4) T(d,n)=0 (columns sum to zero).

Edited by R. J. Mathar, Jul 04 2008

A140344 Catalan triangle A009766 prepended by n zeros in its n-th row.

Original entry on oeis.org

1, 0, 1, 1, 0, 0, 1, 2, 2, 0, 0, 0, 1, 3, 5, 5, 0, 0, 0, 0, 1, 4, 9, 14, 14, 0, 0, 0, 0, 0, 1, 5, 14, 28, 42, 42, 0, 0, 0, 0, 0, 0, 1, 6, 20, 48, 90, 132, 132, 0, 0, 0, 0, 0, 0, 0, 1, 7, 27, 75, 165, 297, 429, 429, 0, 0, 0, 0, 0, 0, 0, 0, 1, 8, 35, 110, 275, 572, 1001, 1430, 1430

Offset: 0

Paul Curtz, May 29 2008

The triangle's n-th row is also related to recurrences for sequences f(n) which p-th differences, p=n+2: The denominator of the generating function contains a factor 1-2x in these cases.
This factor may be "lifted" either by looking at auxiliary sequences f(n+1)-2f(n) or by considering the corresponding "degenerate" shorter recurrences right away. In the case p=4, the recurrence is f(n)=4f(n-1)-6f(n-2)+4f(n-3) from the 4th row in A135356, the denominator in the g.f. is 1-4x+6x^2-4x^3=(1-2x)(1-2x+2x^2), which yields the degenerate recurrence f(n)=2f(n-1)-2f(n-2) from the 2nd factor and leaves the first three coefficients of 1/(1-2x+2x^2)=1+2x+2x^2+.. in row 2.
A000749 is an example which follows the recurrence but not the degenerate recurrence, but still A000749(n+1)-2A000749(n) = 0, 0, 1, 2, 2,.. starts with the 3 coefficients. A009545 follows both recurrences and starts with the three nonzero terms because there is only a power of x in the numerator of the g.f.
In the case p=5, the recurrence is f(n)=5f(n-1)-10f(n-2)+10f(n-3)-5f(n-4)+2f(n-5), the denominator in the g.f. is 1-5x+10x^2-10x^3+5x^4-2x^5= (1-2x)(1-3x+4x^2-2x^3+x^4), where 1/(1-3x+4x^2-2x^3+x^4) = 1+3x+5x^2+5x^3+... and the 4 coefficients populate row 3.
A049016 obeys the main recurrence but not the degenerate recurrence f(n)=3f(n-1)-4f(n-2)+2f(n-3)-f(n-4), yet A049016(n+1)-2A049016(n)=1, 3, 5, 5,.. starts with the 4 coefficients. A138112 obeys both recurrences and is constructed to start with the 4 coefficients themselves.
In the nomenclature of Foata and Han, this is the doubloon polynomial triangle d_{n,m}(0), up to index shifts. - R. J. Mathar, Jan 27 2011

			Triangle starts
1;
0,1,1;
0,0,1,2,2;
0,0,0,1,3,5,5;
0,0,0,0,1,4,9,14,14;

D. Foata, G.-N. Han, The doubloon polynomial triangle, Ramanujan J. 23 (2010), 107-126

Cf. A135356, A130020, A139687, A140343 (p=6), A140342 (p=7).

Table[Join[Array[0&, n], Table[Binomial[n+k, n]*(n-k+1)/(n+1), {k, 0, n}]], {n, 0, 8}] // Flatten (* Jean-François Alcover, Dec 16 2014 *)

Edited by R. J. Mathar, Jul 10 2008

A139687 Basis of degenerate cases of sequences identical to its p-th differences. Complement to A140344 which is based on natural Catalan's triangle. Triangle without first term (probable 1) on line.

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 3, 5, 5, 1, 3, 6, 9, 9, 1, 4, 10, 19, 28, 28, 1, 4, 10, 20, 34, 48, 48, 1, 5, 15, 35, 69, 117, 165, 165, 1, 5, 15, 35, 70, 125, 200, 275, 275, 1, 6, 21, 56, 126, 251, 451, 726, 1001, 1001, 1, 6, 21, 56, 126, 252, 461, 780, 1209, 1638, 1638

Offset: 0

Paul Curtz, Jun 13 2008

Triangle from A140344:
(1;)
0, 1, 1;
0, 0, 1, 2, 2;
0, 0, 0, 1, 3, 5, 5; see A138112,
0, 0, 0, 0, 1, 4, 9, 14, 14; see A140343,
begins (without 0's) like a(n).

Cf. A135356, A140344.

First four rows of triangle from second row: 1, 1; 1, 2, 2; see A099087, 1, 3, 5, 5; 1, 3, 6, 9, 9; see A057083 which can be preceded with 3 leading 0's, are, as said, from natural Catalan's triangle A009766. Origin of a(n) explained later.

A157823 a(n) = A156591(n) + A156591(n+1).

Original entry on oeis.org

-5, -1, -2, -4, -8, -16, -32, -64, -128, -256, -512, -1024, -2048, -4096, -8192, -16384, -32768, -65536, -131072, -262144, -524288, -1048576, -2097152, -4194304, -8388608, -16777216, -33554432, -67108864, -134217728, -268435456, -536870912, -1073741824

Offset: 0

Paul Curtz, Mar 07 2009

A156591 = 2,-7,6,-8,4,-12,... a(n) is companion to A154589 = 4,-1,-2,-4,-8,.For this kind ,companion of sequence b(n) is first differences a(n), second differences being b(n). Well known case: A131577 and A011782. a(n)+b(n)=A000079 or -A000079. a(n)=A154570(n+2)-A154570(n) ,A154570 = 1,3,-4,2,-6,-2,-14,. See sequence(s) identical to its p-th differences (A130785,A130781,A024495,A000749,A138112(linked to Fibonacci),A139761).

Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (2).

Vec(-(9*x-5)/(2*x-1) + O(x^100)) \\ Colin Barker, Feb 03 2015

a(n) = 2*a(n-1) for n>1. G.f.: -(9*x-5) / (2*x-1). - Colin Barker, Feb 03 2015

Edited by Charles R Greathouse IV, Oct 11 2009

A171408 a(n) = A171373(n+1) - 2*A171373(n).

Original entry on oeis.org

4, 4, 4, 4, 0, -12, -32, -52, -52, 0, 136, 356, 576, 576, 0, -1508, -3948, -6388, -6388, 0, 16724, 43784, 70844, 70844, 0, -185472, -485572, -785672, -785672, 0, 2056916, 5385076, 8713236, 8713236, 0, -22811548, -59721408, -96631268, -96631268, 0, 252983944, 662320564

Offset: 0

Paul Curtz, Dec 08 2009

sign

The least significant digits have a period of length 20. Another period (not the same but of the same length, as this a sequence contains negative numbers) is defined reading the sequence modulo 10.

Index entries for linear recurrences with constant coefficients, signature (3,-4,2,-1)

Cf. A138112, A105371.

a(n)=4*A105371(n-1), n>0.

a(n)= 3*a(n-1) -4*a(n-2) +2*a(n-3) -a(n-4). G.f.: 4*(1-2*x+2*x^2)/(1-3*x+4*x^2-2*x^3+x^4).

Edited and extended by R. J. Mathar, Mar 02 2010

cp's OEIS Frontend

A138110 Table T(d,n) read column by column: the n-th term in the sequence of the d-th differences of A138112, d=0..4.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

Extensions

A140344 Catalan triangle A009766 prepended by n zeros in its n-th row.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A139687 Basis of degenerate cases of sequences identical to its p-th differences. Complement to A140344 which is based on natural Catalan's triangle. Triangle without first term (probable 1) on line.

Views

Author

Keywords

Comments

Crossrefs

Formula

A157823 a(n) = A156591(n) + A156591(n+1).

Views

Author

Keywords

Comments

Links

Programs

PARI

Formula

Extensions

A171408 a(n) = A171373(n+1) - 2*A171373(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

Extensions