A040000 -id:A040000 - cp's OEIS frontend

A054458 Convolution triangle based on A001333(n), n >= 1.

1, 3, 1, 7, 6, 1, 17, 23, 9, 1, 41, 76, 48, 12, 1, 99, 233, 204, 82, 15, 1, 239, 682, 765, 428, 125, 18, 1, 577, 1935, 2649, 1907, 775, 177, 21, 1, 1393, 5368, 8680, 7656, 4010, 1272, 238, 24, 1, 3363, 14641, 27312, 28548, 18358, 7506, 1946, 308, 27, 1

Offset: 0

Wolfdieter Lang, Apr 26 2000

In the language of the Shapiro et al. reference (given in A053121) such a lower triangular (ordinary) convolution array, considered as a matrix, belongs to the Bell-subgroup of the Riordan-group.
The G.f. for the row polynomials p(n,x) (increasing powers of x) is LPell(z)/(1-x*z*LPell(z)) with LPell(z) given in 'Formula'.
Column sequences are A001333(n+1), A054459(n), A054460(n) for m=0..2.
Mirror image of triangle in A209696. - Philippe Deléham, Mar 24 2012
Subtriangle of the triangle given by (0, 3, -2/3, -1/3, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (1, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938. - Philippe Deléham, Mar 25 2012
Riordan array ((1+x)/(1-2*x-x^2), (x+x^2)/(1-2*x-x^2)). - Philippe Deléham, Mar 25 2012

			Fourth row polynomial (n=3): p(3,x)= 17+23*x+9*x^2+x^3.
Triangle begins :
  1
  3, 1
  7, 6, 1
  17, 23, 9, 1
  41, 76, 48, 12, 1
  99, 233, 204, 82, 15, 1
  239, 682, 765, 428, 125, 18, 1. - _Philippe Deléham_, Mar 25 2012
(0, 3, -2/3, -1/3, 0, 0, 0, ...) DELTA (1, 0, 0, 0, ...) begins :
  1
  0, 1
  0, 3, 1
  0, 7, 6, 1
  0, 17, 23, 9, 1
  0, 41, 76, 48, 12, 1
  0, 99, 233, 204, 82, 15, 1
  0, 239, 682, 765, 428, 125, 15, 1. - _Philippe Deléham_, Mar 25 2012

Milan Janjić, Words and Linear Recurrences, J. Int. Seq. 21 (2018), #18.1.4.

Cf. A002203(n+1)/2. Row sums: A055099(n).
Cf. A001333, A054459, A054460.
Cf. A040000, A001333, A055099, A126473, A126501, A126528.

a(n, m) := ((n-m+1)*a(n, m-1) + (2n-m)*a(n-1, m-1) + (n-1)*a(n-2, m-1))/(4*m), n >= m >= 1; a(n, 0)= A001333(n+1); a(n, m) := 0 if n

G.f. for column m: LPell(x)*(x*LPell(x))^m, m >= 0, with LPell(x)= (1+x)/(1-2*x-x^2) = g.f. for A001333(n+1).

G.f.: (1+x)/(1-2*x-y*x-x^2-y*x^2). - Philippe Deléham, Mar 25 2012

T(n,k) = 2*T(n-1,k) + T(n-1,k-1) + T(n-2,k) + T(n-2,k-1), T(0,0) = T(1,1) = 1, T(1,0) = 3 and T(n,k) = 0 if k<0 or if k>n. - Philippe Deléham, Mar 25 2012

Sum_{k=0..n} T(n,k)*x^k = A040000(n), A001333(n+1), A055099(n), A126473(n), A126501(n), A126528(n) for x = -1, 0, 1, 2, 3, 4 respectively. - Philippe Deléham, Mar 25 2012

A097808 Riordan array ((1+2x)/(1+x)^2, 1/(1+x)) read by rows.

Original entry on oeis.org

1, 0, 1, -1, -1, 1, 2, 0, -2, 1, -3, 2, 2, -3, 1, 4, -5, 0, 5, -4, 1, -5, 9, -5, -5, 9, -5, 1, 6, -14, 14, 0, -14, 14, -6, 1, -7, 20, -28, 14, 14, -28, 20, -7, 1, 8, -27, 48, -42, 0, 42, -48, 27, -8, 1, -9, 35, -75, 90, -42, -42, 90, -75, 35, -9, 1, 10, -44, 110, -165, 132, 0, -132, 165, -110, 44, -10, 1

Offset: 0

Paul Barry, Aug 25 2004

Inverse of A059260. Row sums are inverse binomial transform of A040000, with g.f. (1+2x)/(1+x). Diagonal sums are (-1)^n(1-Fib(n)). A097808=B^(-1)*A097806, where B is the binomial matrix. B*A097808*B^(-1) is the inverse of A097805.

			Rows begin
1;
0, 1;
-1, -1, 1;
2, 0, -2, 1;
-3, 2, 2, -3, 1;
4, -5, 0, 5, -4, 1;
-5, 9, -5, -5, 9, -5, 1;
6, -14, 14, 0, -14, 14, -6, 1;
-7, 20, -28, 14, 14, -28, 20, -7, 1;
8, -27, 48, -42, 0, 42, -48, 27, -8, 1;

Robert Israel, Table of n, a(n) for n = 0..10010 (rows 0 to 140, flattened)

T:= proc(n,k) option remember;
if k < 0 or k > n then return 0 fi;
procname (n-1,k-1)-3*procname(n-1,k)+2*procname(n-2,k-1)-3*procname(n-2,k)+
procname(n-3,k-1)-procname(n-3,k)
end proc:
T(0,0):= 1: T(1,1):= 1: T(2,2):= 1:
T(1,0):= 0: T(2,0):= -1: T(2,1):= -1:
seq(seq(T(n,k),k=0..n),n=0..12); # Robert Israel, Jul 16 2019

(* The function RiordanArray is defined in A256893. *)
RiordanArray[(1 + 2 #)/(1 + #)^2&, #/(1 + #)&, 12] // Flatten (* Jean-François Alcover, Jul 16 2019 *)

Columns have g.f. (1+2x)/(1+x)^2(x/(1+x))^k.
T(n,k)=T(n-1,k-1)-3*T(n-1,k)+2*T(n-2,k-1)-3*T(n-2,k)+T(n-3,k-1)-T(n-3,k), T(0,0)=T(1,1)=T(2,2)=1, T(1,0)=0, T(2,0)=T(2,1)=-1, T(n,k)=0 if k<0 or if k>n. - Philippe Deléham, Jan 12 2014
T(0,0)=1, T(n,0)=(-1)^(n-1)*(n-1) for n>0, T(n,n)=1, T(n,k)=T(n-1,k-1)-T(n-1,k) for 0Philippe Deléham, Jan 12 2014

A101104 a(1)=1, a(2)=12, a(3)=23, and a(n)=24 for n>=4.

Original entry on oeis.org

1, 12, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24

Offset: 1

Cecilia Rossiter, Dec 15 2004

Original name: The first summation of row 4 of Euler's triangle - a row that will recursively accumulate to the power of 4.

D. J. Pengelley, The bridge between the continuous and the discrete via original sources in Study the Masters: The Abel-Fauvel Conference [pdf], Kristiansand, 2002, (ed. Otto Bekken et al), National Center for Mathematics Education, University of Gothenburg, Sweden, in press.
C. Rossiter, Depictions, Explorations and Formulas of the Euler/Pascal Cube [Dead link]
C. Rossiter, Depictions, Explorations and Formulas of the Euler/Pascal Cube [Cached copy, May 15 2013]
Eric Weisstein, Link to section of MathWorld: Worpitzky's Identity of 1883
Eric Weisstein, Link to section of MathWorld: Eulerian Number
Eric Weisstein, Link to section of MathWorld: Nexus number
Eric Weisstein, Link to section of MathWorld: Finite Differences
Index entries for linear recurrences with constant coefficients, signature (1).

For other sequences based upon MagicNKZ(n,k,z):
..... |  n = 1  |  n = 2  |  n = 3  |  n = 4  |  n = 5  |  n = 6  |  n = 7
---------------------------------------------------------------------------
z = 0 | A000007 | A019590 | .......MagicNKZ(n,k,0) = A008292(n,k+1) .......
z = 1 | A000012 | A040000 | A101101 | thisSeq | A101100 | ....... | .......
z = 2 | A000027 | A005408 | A008458 | A101103 | A101095 | ....... | .......
z = 3 | A000217 | A000290 | A003215 | A005914 | A101096 | ....... | .......
z = 4 | A000292 | A000330 | A000578 | A005917 | A101098 | ....... | .......
z = 5 | A000332 | A002415 | A000537 | A000583 | A022521 | ....... | A255181
z = 6 | A000389 | A005585 | A024166 | A000538 | A000584 | A022522 | A255177
z = 7 | A000579 | A040977 | A101094 | A101089 | A000539 | A001014 | A022523
z = 8 | A000580 | A050486 | A101097 | A101090 | A101092 | A000540 | A001015
z = 9 | A000581 | A053347 | A101102 | A101091 | A101099 | A101093 | A000541
Cf. A101095 for an expanded table and more about MagicNKZ.

MagicNKZ = Sum[(-1)^j*Binomial[n+1-z, j]*(k-j+1)^n, {j, 0, k+1}];Table[MagicNKZ, {n, 4, 4}, {z, 1, 1}, {k, 0, 34}]
Join[{1, 12, 23},LinearRecurrence[{1},{24},56]] (* Ray Chandler, Sep 23 2015 *)

a(k) = MagicNKZ(4,k,1) where MagicNKZ(n,k,z) = Sum_{j=0..k+1} (-1)^j*binomial(n+1-z,j)*(k-j+1)^n (cf. A101095). That is, a(k) = Sum_{j=0..k+1} (-1)^j*binomial(4, j)*(k-j+1)^4.
a(1)=1, a(2)=12, a(3)=23, and a(n)=24 for n>=4. - Joerg Arndt, Nov 30 2014
G.f.: x*(1+11*x+11*x^2+x^3)/(1-x). - Colin Barker, Apr 16 2012

New name from Joerg Arndt, Nov 30 2014

Original Formula edited and Crossrefs table added by Danny Rorabaugh, Apr 22 2015

A165326 a(0)=a(1)=1, a(n) = -a(n-1) for n > 1.

Original entry on oeis.org

1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1

Offset: 0

Philippe Deléham, Sep 14 2009

Inverse binomial transform of A040000(n) = 1,2,2,2,2,...; binomial transform of (-1)^(n+1)*A000918(n) = 1,0,-2,6,-14,30,-62,... - Philippe Deléham, Sep 16 2009

This is also the Z-sequence of the Riordan triangle A105809. See the W. Lang link under A006232 for Riordan A- and Z-sequences. - Wolfdieter Lang, Oct 04 2014

Index entries for linear recurrences with constant coefficients, signature (-1).

Cf. A033999.

PadRight[{1},120,{-1,1}] (* Harvey P. Dale, Dec 04 2012 *)
Join[{1},LinearRecurrence[{-1},{1},83]] (* Ray Chandler, Aug 12 2015 *)

G.f.: (1+2*x)/(1+x).
E.g.f.: 2-exp(-x).
a(n) = -a(n-1). - Wesley Ivan Hurt, Apr 23 2021

A171440 Expansion of (1+x)^5/(1-x).

Original entry on oeis.org

1, 6, 16, 26, 31, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32

Offset: 0

Richard Choulet, Dec 09 2009

a(n)=2^5=32 for n>=5. We observe that this sequence is the transform of A171418 by T such that: T(u_0,u_1,u_2,u_3,u_4,u_5,...)=(u_0,u_0+u_1,u_1+u_2,u_2+u_3,u_3+u_4,...).

Also continued fraction expansion of (229657824-sqrt(257))/197139199. - Bruno Berselli, Sep 23 2011

			a(4) = C(6,4-0)+C(6,4-2)+C(6,4-4) = 15+15+1 = 31.

Vincenzo Librandi, Table of n, a(n) for n = 0..100
Richard Choulet, Une nouvelle formule de combinatoire?, Mathématique et Pédagogie, 157 (2006), p. 53-60. In French.
Index entries for linear recurrences with constant coefficients, signature (1).

Cf. A040000, A113311, A115291, A171418, A171441, A171442, A171443.

PadRight[{1,6,16,26,31},100,32] (* Harvey P. Dale, Oct 01 2013 *)

With m=6, a(n) = Sum_{k=0..floor(n/2)} binomial(m,n-2*k).

Definition rewritten by Bruno Berselli, Sep 23 2011

A171443 Expansion of g.f. (1+x)^8/(1-x).

Original entry on oeis.org

1, 9, 37, 93, 163, 219, 247, 255, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256, 256

Offset: 0

Richard Choulet, Dec 09 2009

a(n)=2^8=256 for n>=8. We observe that this sequence is the transform of A171442 by T such that: T(u_0,u_1,u_2,u_3,u_4,u_5,...)=(u_0,u_0+u_1,u_1+u_2,u_2+u_3,u_3+u_4,...).

			a(7) = C(9,7-0)+C(9,7-2)+C(9,7-4)+C(9,7-6) = 36+126+84+9 = 255.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Richard Choulet, Une nouvelle formule de combinatoire?, Mathématique et Pédagogie, 157 (2006), p. 53-60. In French.
Index entries for linear recurrences with constant coefficients, signature (1).

Cf. A040000, A113311, A115291, A171418, A171440, A171441, A171442.

m:=9:for n from 0 to 40 do a(n):=sum('binomial(m,n-2*k)',k=0..floor(n/2)): od : seq(a(n),n=0..40);

CoefficientList[Series[(1+x)^8/(1-x),{x,0,80}],x] (* Harvey P. Dale, Jul 22 2014 *)

With m=9, a(n) = Sum_{k=0..floor(n/2)} binomial(m,n-2*k).

Definition rewritten by Bruno Berselli, Sep 23 2011

A277561 a(n) = Sum_{k=0..n} ({binomial(n+2k,2k)*binomial(n,k)} mod 2).

Original entry on oeis.org

1, 2, 2, 2, 2, 4, 2, 2, 2, 4, 4, 4, 2, 4, 2, 2, 2, 4, 4, 4, 4, 8, 4, 4, 2, 4, 4, 4, 2, 4, 2, 2, 2, 4, 4, 4, 4, 8, 4, 4, 4, 8, 8, 8, 4, 8, 4, 4, 2, 4, 4, 4, 4, 8, 4, 4, 2, 4, 4, 4, 2, 4, 2, 2, 2, 4, 4, 4, 4, 8, 4, 4, 4, 8, 8, 8, 4, 8, 4, 4, 4, 8, 8, 8, 8, 16, 8

Offset: 0

Chai Wah Wu, Oct 19 2016

Equals the run length transform of A040000: 1,2,2,2,2,2,...

Chai Wah Wu, Table of n, a(n) for n = 0..10000
Chai Wah Wu, Sums of products of binomial coefficients mod 2 and run length transforms of sequences, arXiv:1610.06166 [math.CO], 2016.
Index entries for sequences computed with run length transform

Cf. A005940, A034444, A040000, A069010, A106737.

A277561:= func< n | (&+[(Binomial(n+2*k, 2*k)*Binomial(n,k)) mod 2 : k in [0..n]]) >;
[A277561(n): n in [0..100]]; // G. C. Greubel, Sep 06 2025

Table[Sum[Mod[Binomial[n + 2 k, 2 k] Binomial[n, k], 2], {k, 0, n}], {n, 0, 86}] (* Michael De Vlieger, Oct 21 2016 *)

a(n) = sum(k=0, n, binomial(n+2*k, 2*k)*binomial(n,k) % 2); \\ Michel Marcus, Oct 21 2016

def A277561(n):
    return sum(int(not (~(n+2*k) & 2*k) | (~n & k)) for k in range(n+1))

a(n) = 2^A069010(n). a(2n) = a(n), a(4n+1) = 2a(n), a(4n+3) = a(2n+1). - Chai Wah Wu, Nov 04 2016

a(n) = A034444(A005940(1+n)). - Antti Karttunen, May 29 2017

A302996 Square array A(n,k), n >= 0, k >= 0, read by antidiagonals: A(n,k) = [x^(n^2)] theta_3(x)^k, where theta_3() is the Jacobi theta function.

Original entry on oeis.org

1, 1, 0, 1, 2, 0, 1, 4, 2, 0, 1, 6, 4, 2, 0, 1, 8, 6, 4, 2, 0, 1, 10, 24, 30, 4, 2, 0, 1, 12, 90, 104, 6, 12, 2, 0, 1, 14, 252, 250, 24, 30, 4, 2, 0, 1, 16, 574, 876, 730, 248, 30, 4, 2, 0, 1, 18, 1136, 3542, 4092, 1210, 312, 54, 4, 2, 0, 1, 20, 2034, 12112, 18494, 7812, 2250, 456, 6, 4, 2, 0

Offset: 0

Ilya Gutkovskiy, Apr 17 2018

A(n,k) is the number of ordered ways of writing n^2 as a sum of k squares.

			Square array begins:
  1,  1,   1,   1,    1,     1,  ...
  0,  2,   4,   6,    8,    10,  ...
  0,  2,   4,   6,   24,    90,  ...
  0,  2,   4,  30,  104,   250,  ...
  0,  2,   4,   6,   24,   730,  ...
  0,  2,  12,  30,  248,  1210,  ...

Alois P. Heinz, Antidiagonals n = 0..200, flattened
Eric Weisstein's World of Mathematics, Jacobi Theta Functions
Index entries for sequences related to sums of squares

Columns k=0..4,7 give A000007, A040000, A046109, A016725, A267326, A361695.
Main diagonal gives A232173.
Cf. A000122, A122141, A255212, A286815.

b:= proc(n, t) option remember; `if`(n=0, 1, `if`(n<0 or t<1, 0,
      b(n, t-1)+2*add(b(n-j^2, t-1), j=1..isqrt(n))))
    end:
A:= (n, k)-> b(n^2, k):
seq(seq(A(n,d-n), n=0..d), d=0..12);  # Alois P. Heinz, Mar 10 2023

Table[Function[k, SeriesCoefficient[EllipticTheta[3, 0, x]^k, {x, 0, n^2}]][j - n], {j, 0, 11}, {n, 0, j}] // Flatten
Table[Function[k, SeriesCoefficient[Sum[x^i^2, {i, -n, n}]^k, {x, 0, n^2}]][j - n], {j, 0, 11}, {n, 0, j}] // Flatten

A(n,k) = [x^(n^2)] (Sum_{j=-infinity..infinity} x^(j^2))^k.

Previous Showing 51-60 of 199 results. Next

For n>=4 a(n)=2^4=16. This sequence is the transform of A115291 by the following transform T: T(u_0,u_1,u_2,u_3,u_4,...)=(u_0, u_0+u_1, u_1+u_2,u_2+u_3, ...); we observe that T(A040000)=A113311 and also T(A113311)=A115291.

Also continued fraction expansion of (55305+sqrt(65))/46231. - Bruno Berselli, Sep 23 2011

cp's OEIS Frontend

A171418 Expansion of (1+x)^4/(1-x).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Formula

Extensions

A255740 Square array read by antidiagonals upwards: T(n,1) = 1; for k > 1, T(n,k) = (n-1)*(n-2)^(A000120(k-1)-1) with n >= 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A054458 Convolution triangle based on A001333(n), n >= 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A097808 Riordan array ((1+2x)/(1+x)^2, 1/(1+x)) read by rows.

Views

Author

Keywords

Comments

Examples

Links

Programs

Maple

Mathematica

Formula

A101104 a(1)=1, a(2)=12, a(3)=23, and a(n)=24 for n>=4.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A165326 a(0)=a(1)=1, a(n) = -a(n-1) for n > 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A171440 Expansion of (1+x)^5/(1-x).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A171443 Expansion of g.f. (1+x)^8/(1-x).

Views

Author