A023531 -id:A023531 - cp's OEIS frontend

A030528 Triangle read by rows: a(n,k) = binomial(k,n-k).

1, 1, 1, 0, 2, 1, 0, 1, 3, 1, 0, 0, 3, 4, 1, 0, 0, 1, 6, 5, 1, 0, 0, 0, 4, 10, 6, 1, 0, 0, 0, 1, 10, 15, 7, 1, 0, 0, 0, 0, 5, 20, 21, 8, 1, 0, 0, 0, 0, 1, 15, 35, 28, 9, 1, 0, 0, 0, 0, 0, 6, 35, 56, 36, 10, 1, 0, 0, 0, 0, 0, 1, 21, 70, 84, 45, 11, 1, 0, 0, 0, 0, 0, 0, 7, 56, 126, 120, 55, 12, 1

Offset: 1

Wolfdieter Lang

A convolution triangle of numbers obtained from A019590.
a(n,m) := s1(-1; n,m), a member of a sequence of triangles including s1(0; n,m)= A023531(n,m) (unit matrix) and s1(2; n,m)= A007318(n-1,m-1) (Pascal's triangle).
The signed triangular matrix a(n,m)*(-1)^(n-m) is the inverse matrix of the triangular Catalan convolution matrix A033184(n+1,m+1), n >= m >= 0, with A033184(n,m) := 0 if nRiordan array (1+x, x(1+x)). The signed triangle is the Riordan array (1-x,x(1-x)), inverse to (c(x),xc(x)) with c(x) g.f. for A000108. - Paul Barry, Feb 02 2005 [with offset 0]
Also, a(n,k)=number of compositions of n into k parts of 1's and 2's. Example: a(6,4)=6 because we have 2211, 2121, 2112, 1221, 1212 and 1122. - Emeric Deutsch, Apr 05 2005 [see MacMahon and Riordan. - Wolfdieter Lang, Jul 27 2023]
Subtriangle of A026729. - Philippe Deléham, Aug 31 2006
a(n,k) is the number of length n-1 binary sequences having no two consecutive 0's with exactly k-1 1's. Example: a(6,4)=6 because we have 01011, 01101, 01110, 10101, 10110, 11010. - Geoffrey Critzer, Jul 22 2013
Mirrored, shifted Fibonacci polynomials of A011973. The polynomials (illustrated below) of this entry have the property that p(n,t) = t * [p(n-1,t) + p(n-2,t)]. The additive properties of Pascal's triangle (A007318) are reflected in those of these polynomials, as can be seen in the Example Section below and also when the o.g.f. G(x,t) below is expanded as the series x*(1+x) + t * [x*(1+x)]^2 + t^2 * [x*(1+x)]^3 + ... . See also A053122 for a relation to Cartan matrices. - Tom Copeland, Nov 04 2014
Rows of this entry appear as columns of an array for an infinitesimal generator presented in the Copeland link. - Tom Copeland, Dec 23 2015
For n >= 2, the n-th row is also the coefficients of the vertex cover polynomial of the (n-1)-path graph P_{n-1}. - Eric W. Weisstein, Apr 10 2017
With an additional initial matrix element a_(0,0) = 1 and column of zeros a_(n,0) = 0 for n > 0, these are antidiagonals read from bottom to top of the numerical coefficients of the Maurer-Cartan form matrix of the Leibniz group L^(n)(1,1) presented on p. 9 of the Olver paper, which is generated as exp[c. * M] with (c.)^n = c_n and M the Lie infinitesimal generator A218272. Cf. A011973. And A169803. - Tom Copeland, Jul 02 2018

			Triangle starts:
  [ 1]  1
  [ 2]  1   1
  [ 3]  0   2   1
  [ 4]  0   1   3   1
  [ 5]  0   0   3   4   1
  [ 6]  0   0   1   6   5   1
  [ 7]  0   0   0   4  10   6   1
  [ 8]  0   0   0   1  10  15   7   1
  [ 9]  0   0   0   0   5  20  21   8   1
  [10]  0   0   0   0   1  15  35  28   9   1
  [11]  0   0   0   0   0   6  35  56  36  10   1
  [12]  0   0   0   0   0   1  21  70  84  45  11   1
  [13]  0   0   0   0   0   0   7  56 126 120  55  12   1
  ...
From _Tom Copeland_, Nov 04 2014: (Start)
For quick comparison to other polynomials:
  p(1,t) = 1
  p(2,t) = 1 + 1 t
  p(3,t) = 0 + 2 t + 1 t^2
  p(4,t) = 0 + 1 t + 3 t^2 + 1 t^3
  p(5,t) = 0 + 0   + 3 t^2 + 4 t^3 +  1 t^4
  p(6,t) = 0 + 0   + 1 t^2 + 6 t^3 +  5 t^4 +  1 t^5
  p(7,t) = 0 + 0   + 0     + 4 t^3 + 10 t^4 +  6 t^5 + 1 t^6
  p(8,t) = 0 + 0   + 0     + 1 t^3 + 10 t^4 + 15 t^5 + 7 t^6 + 1 t^7
  ...
Reading along columns gives rows for Pascal's triangle. (End)

P. A. MacMahon, Combinatory Analysis, Two volumes (bound as one), Chelsea Publishing Company, New York, 1960, Vol. I, nr. 124, p. 151.
John Riordan, An Introduction to Combinatorial Analysis, John Wiley & Sons, London, 1958. eq. (35), p.124, 11. p. 154.

Indranil Ghosh, Rows 1..125 of triangle, flattened
Jean Luc Baril, Rigoberto Flórez, and José L. Ramirez, Generalized Narayana arrays, restricted Dyck paths, and related bijections, Univ. Bourgogne (France, 2025). See p. 18.
Tom Copeland, Generators, Inversion, and Matrix, Binomial, and Integral Transforms, Addendum to Elliptic Lie Triad
Loïc Foissy, Cointeraction on noncrossing partitions and related polynomial invariants, arXiv:2501.18212 [math.CO], 2025. See p. 21.
Wolfdieter Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.
Donatella Merlini, Renzo Sprugnoli, and M. Cecilia Verri, An algebra for proper generating trees, Colloquium on Mathematics and Computer Science, Versailles, September 2000.
Donatella Merlini, Renzo Sprugnoli, and M. Cecilia Verri, An algebra for proper generating trees, Mathematics and Computer Science, Part of the series Trends in Mathematics pp 127-139.
Peter J. Olver, The canonical contact form.
Eric Weisstein's World of Mathematics, Path Graph
Eric Weisstein's World of Mathematics, Vertex Cover Polynomial

Row sums A000045(n+1) (Fibonacci). a(n, 1)= A019590(n) (Fermat's last theorem). Cf. A049403.

Cf. A104597, A146559, A155020, A125145, A057078, A039717, A001792, A057862, A011973, A115139.

/* As triangle */ [[Binomial(k, n-k): k in [1..n]]: n in [1.. 15]]; // Vincenzo Librandi, Nov 05 2014

for n from 1 to 12 do seq(binomial(k,n-k),k=1..n) od; # yields sequence in triangular form - Emeric Deutsch, Apr 05 2005

nn=10;CoefficientList[Series[(1+x)/(1-y x - y x^2),{x,0,nn}],{x,y}]//Grid (* Geoffrey Critzer, Jul 22 2013 *)
Table[Binomial[k, n - k], {n, 13}, {k, n}] // Flatten (* Michael De Vlieger, Dec 23 2015 *)
CoefficientList[Table[x^(n/2 - 1) Fibonacci[n + 1, Sqrt[x]], {n, 10}],
   x] // Flatten (* Eric W. Weisstein, Apr 10 2017 *)

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

G.f. for m-th column: (x*(1+x))^m.

As a number triangle with offset 0, this is T(n, k) = Sum_{i=0..n} (-1)^(n+i)*binomial(n, i)*binomial(i+k+1, 2k+1). The antidiagonal sums give the Padovan sequence A000931(n+5). Inverse binomial transform of A078812 (product of lower triangular matrices). - Paul Barry, Jun 21 2004

G.f.: (1 + x)/(1 - y*x - y*x^2). - Geoffrey Critzer, Jul 22 2013 [offset 0] [with offset 1: g.f. of row polynomials in y: x*(1+x)*y/(1 - x*(1+x)*y). - Wolfdieter Lang, Jul 27 2023]

From Tom Copeland, Nov 04 2014: (Start)

O.g.f: G(x,t) = x*(1+x) / [1 - t*x*(1+x)] = -P[Cinv(-x),t], where P(x,t)= x / (1 + t*x) and Cinv(x)= x*(1-x) are the compositional inverses in x of Pinv(x,t) = -P(-x,t) = x / (1 - t*x) and C(x) = [1-sqrt(1-4*x)]/2, an o.g.f. for the shifted Catalan numbers A000108.

Therefore, Ginv(x,t) = -C[Pinv(-x,t)] = {-1 + sqrt[1 + 4*x/(1+t*x)]}/2, which is -A124644(-x,t).

This places this array in a family of arrays related by composition of P and C and their inverses and interpolation by t, such as A091867 and A104597, and associated to the Catalan, Motzkin, Fine, and Fibonacci numbers. Cf. A104597 (polynomials shifted in t) A125145, A146559, A057078, A000045, A155020, A125145, A039717, A001792, A057862, A011973, A115139. (End)

More terms from Emeric Deutsch, Apr 05 2005

A007401 Add n-1 to n-th term of 'n appears n times' sequence (A002024).

Original entry on oeis.org

1, 3, 4, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26, 28, 29, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76

Offset: 1

N. J. A. Sloane, Mira Bernstein

Complement of A000096 = increasing sequence of positive integers excluding n*(n+3)/2. - Jonathan Vos Post, Aug 13 2005
As a triangle: (1; 3,4; 6,7,8; 10,11,12,13; ...), Row sums = A127736: (1, 7, 21, 46, 85, 141, 217, ...). - Gary W. Adamson, Oct 25 2007
Odd primes are a subsequence except 5, cf. A004139. - Reinhard Zumkeller, Jul 18 2011
A023532(a(n)) = 1. - Reinhard Zumkeller, Dec 04 2012
T(n,k) = ((n+k)^2+n-k)/2 - 1, n,k > 0, read by antidiagonals. - Boris Putievskiy, Jan 14 2013
A023531(a(n)) = 0. - Reinhard Zumkeller, Feb 14 2015

			From _Boris Putievskiy_, Jan 14 2013: (Start)
The start of the sequence as table:
   1,  3,  6, 10, 15, 21, 28, ...
   4,  7, 11, 16, 22, 29, 37, ...
   8, 12, 17, 23, 30, 38, 47, ...
  13, 18, 24, 31, 39, 48, 58, ...
  19, 25, 32, 40, 49, 59, 70, ...
  26, 33, 41, 50, 60, 71, 83, ...
  34, 42, 51, 61, 72, 84, 97, ...
  ...
The start of the sequence as triangle array read by rows:
   1;
   3,  4;
   6,  7,  8;
  10, 11, 12, 13;
  15, 16, 17, 18, 19;
  21, 22, 23, 24, 25, 26;
  28, 29, 30, 31, 32, 33, 34;
  ...
Row number r contains r numbers r*(r+1)/2, r*(r+1)/2+1, ..., r*(r+1)/2+r-1. (End)

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Boris Putievskiy, Transformations [of] Integer Sequences And Pairing Functions arXiv:1212.2732 [math.CO], 2012.
J. Riordan, The enumeration of trees by height and diameter, IBM Journal 4 (1960), 473-478. (Annotated scanned copy)
T. R. S. Walsh & N. J. A. Sloane, Correspondence, 1991
T. R. S. Walsh, Data (Preprint 1, Part 1)
T. R. S. Walsh, Data (Preprint 1, Part 2)
T. R. S. Walsh, Data (Preprint 1, Part 3)
T. R. S. Walsh, Notes
T. R. S. Walsh, Number of sensed planar maps with n edges and m vertices
N. C. Wormald, On the number of planar maps, Can. J. Math. 33.1 (1981), 1-11. (Annotated scanned copy)

Cf. A002024, A000096, A127736, A014132, A002260, A004736, A003057, A114327, A023531.

a007401 n = a007401_list !! n
a007701_list = [x | x <- [0..], a023531 x == 0]
-- Reinhard Zumkeller, Feb 14 2015, Dec 04 2012

f[n_] := n + Floor[ Sqrt[2n] - 1/2]; Array[f, 66]; (* Robert G. Wilson v, Feb 13 2011 *)

a(n)=n+floor(sqrt(n+n)-1/2) \\ Charles R Greathouse IV, Feb 13 2011

for(m=1,9, for(n=m*(m+1)/2,(m^2+3*m-2)/2, print1(n", "))) \\ Charles R Greathouse IV, Feb 13 2011

from math import isqrt
def A007401(n): return n-1+(isqrt(n<<3)+1>>1) # Chai Wah Wu, Oct 18 2022

From Boris Putievskiy, Jan 14 2013: (Start)
a(n) = A014132(n) - 1.
a(n) = A003057(n)^2 - A114327(n) - 1.
a(n) = ((t+2)^2 + i - j)/2-1, where
i = n-t*(t+1)/2,
j = (t*t+3*t+4)/2-n,
t = floor((-1+sqrt(8*n-7))/2). (End)

A001614 Connell sequence: 1 odd, 2 even, 3 odd, ...

Original entry on oeis.org

1, 2, 4, 5, 7, 9, 10, 12, 14, 16, 17, 19, 21, 23, 25, 26, 28, 30, 32, 34, 36, 37, 39, 41, 43, 45, 47, 49, 50, 52, 54, 56, 58, 60, 62, 64, 65, 67, 69, 71, 73, 75, 77, 79, 81, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 122

Offset: 1

N. J. A. Sloane

Next (2n-1) odd numbers alternating with next 2n even numbers. Squares (A000290(n)) occur at the A000217(n)-th entry. - Lekraj Beedassy, Aug 06 2004. - Comment corrected by Daniel Forgues, Jul 18 2009
a(t_n) = a(n(n+1)/2) = n^2 relates squares to triangular numbers. - Daniel Forgues
The natural numbers not included are A118011(n) = 4n - a(n) as n=1,2,3,... - Paul D. Hanna, Apr 10 2006
As a triangle with row sums = A069778 (1, 6, 21, 52, 105, ...): /Q 1;/Q 2, 4;/Q 5, 7, 9;/Q 10, 12, 14, 16;/Q ... . - Gary W. Adamson, Sep 01 2008
The triangle sums, see A180662 for their definitions, link the Connell sequence A001614 as a triangle with six sequences, see the crossrefs. - Johannes W. Meijer, May 20 2011
a(n) = A122797(n) + n - 1. - Reinhard Zumkeller, Feb 12 2012

			From _Omar E. Pol_, Aug 13 2013: (Start)
Written as a triangle the sequence begins:
   1;
   2,  4;
   5,  7,  9;
  10, 12, 14, 16;
  17, 19, 21, 23, 25;
  26, 28, 30, 32, 34, 36;
  37, 39, 41, 43, 45, 47, 49;
  50, 52, 54, 56, 58, 60, 62, 64;
  65, 67, 69, 71, 73, 75, 77, 79, 81;
  82, 84, 86, 88, 90, 92, 94, 96, 98, 100;
  ...
Right border gives A000290, n >= 1.
(End)

C. Pickover, Computers and the Imagination, St. Martin's Press, NY, 1991, p. 276.
C. A. Pickover, The Mathematics of Oz, Chapter 39, Camb. Univ. Press UK 2002.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 1..1000
Ian Connell and Andrew Korsak, Problem E1382, Amer. Math. Monthly, 67 (1960), 380.
Douglas E. Iannucci and Donna Mills-Taylor, On Generalizing the Connell Sequence, J. Integer Sequences, Vol. 2, 1999, #99.1.7.
H. P. Robinson and N. J. A. Sloane, Correspondence, 1971-1972
N. J. A. Sloane, Handwritten notes on Self-Generating Sequences, 1970 (note that A1148 has now become A005282)
Gary E. Stevens, A Connell-Like Sequence, J. Integer Sequences, Vol. 1, 1998, #98.1.4.
Eric Weisstein's World of Mathematics, Connell Sequence

Cf. A117384, A118011 (complement), A118012.
Cf. A069778. - Gary W. Adamson, Sep 01 2008
From Johannes W. Meijer, May 20 2011: (Start)
Triangle columns: A002522, A117950 (n>=1), A117951 (n>=2), A117619 (n>=3), A154533 (n>=5), A000290 (n>=1), A008865 (n>=2), A028347 (n>=3), A028878 (n>=1), A028884 (n>=2), A054569 [T(2*n,n)].
Triangle sums (see the comments): A069778 (Row1), A190716 (Row2), A058187 (Related to Kn11, Kn12, Kn13, Kn21, Kn22, Kn23, Fi1, Fi2, Ze1 and Ze2), A000292 (Related to Kn3, Kn4, Ca3, Ca4, Gi3 and Gi4), A190717 (Related to Ca1, Ca2, Ze3, Ze4), A190718 (Related to Gi1 and Gi2). (End)
Cf. A014132, A057211, A023531.

a001614 n = a001614_list !! (n-1)
a001614_list = f 0 0 a057211_list where
   f c z (x:xs) = z' : f x z' xs where z' = z + 1 + 0 ^ abs (x - c)
-- Reinhard Zumkeller, Dec 30 2011

[2*n-Round(Sqrt(2*n)): n in [1..80]]; // Vincenzo Librandi, Apr 17 2015

A001614:=proc(n): 2*n - floor((1+sqrt(8*n-7))/2) end: seq(A001614(n),n=1..67); # Johannes W. Meijer, May 20 2011

lst={};i=0;For[j=1, j<=4!, a=i+1;b=j;k=0;For[i=a, i<=9!, k++;AppendTo[lst, i];If[k>=b, Break[]];i=i+2];j++ ];lst (* Vladimir Joseph Stephan Orlovsky, Aug 29 2008 *)
row[n_] := 2*Range[n+1]+n^2-1; Table[row[n], {n, 0, 11}] // Flatten (* Jean-François Alcover, Oct 25 2013 *)

a(n)=2*n - round(sqrt(2*n)) \\ Charles R Greathouse IV, Apr 20 2015

from math import isqrt
def A001614(n): return (m:=n<<1)-(k:=isqrt(m))-int((m<<2)>(k<<2)*(k+1)+1) # Chai Wah Wu, Jul 26 2022

a(n) = 2*n - floor( (1+ sqrt(8*n-7))/2 ).
a(n) = A005843(n) - A002024(n). - Lekraj Beedassy, Aug 06 2004
a(n) = A118012(A118011(n)). A117384( a(n) ) = n; A117384( 4*n - a(n) ) = n. - Paul D. Hanna, Apr 10 2006
a(1) = 1; then a(n) = a(n-1)+1 if a(n-1) is a square, a(n) = a(n-1)+2 otherwise. For example, a(21)=36 is a square therefore a(22)=36+1=37 which is not a square so a(23)=37+2=39 ... - Benoit Cloitre, Feb 07 2007
T(n,k) = (n-1)^2 + 2*k - 1. - Omar E. Pol, Aug 13 2013
a(n)^2 = a(n*(n+1)/2). - Ivan N. Ianakiev, Aug 15 2013
Let the sequence be written in the form of the triangle in the EXAMPLE section below and let a(n) and a(n+1) belong to the same row of the triangle. Then a(n)*a(n+1) + 1 = a(A000217(A118011(n))) = A000290(A118011(n)). - Ivan N. Ianakiev, Aug 16 2013
a(n) = 2*n-round(sqrt(2*n)). - Gerald Hillier, Apr 15 2015
From Robert Israel, Apr 20 2015 (Start):
G.f.: 2*x/(1-x)^2 - (x/(1-x))*Sum_{n>=0} x^(n*(n+1)/2) = 2*x/(1-x)^2 - (Theta2(0,x^(1/2)))*x^(7/8)/(2*(1-x)) where Theta2 is a Jacobi theta function.
a(n) = 2*n-1 - Sum_{i=0..n-2} A023531(i).  (End)
a(n) = 3*n-A014132(n). - Chai Wah Wu, Oct 19 2024

More terms from Larry Reeves (larryr(AT)acm.org), Mar 16 2001

A193091 Augmentation of the triangular array A158405. See Comments.

Original entry on oeis.org

1, 1, 3, 1, 6, 14, 1, 9, 37, 79, 1, 12, 69, 242, 494, 1, 15, 110, 516, 1658, 3294, 1, 18, 160, 928, 3870, 11764, 22952, 1, 21, 219, 1505, 7589, 29307, 85741, 165127, 1, 24, 287, 2274, 13355, 61332, 224357, 638250, 1217270, 1, 27, 364, 3262, 21789, 115003

Offset: 0

Clark Kimberling, Jul 30 2011

Suppose that P is an infinite triangular array of numbers:
p(0,0)
p(1,0)...p(1,1)
p(2,0)...p(2,1)...p(2,2)
p(3,0)...p(3,1)...p(3,2)...p(3,3)...
...
Let w(0,0)=1, w(1,0)=p(1,0), w(1,1)=p(1,1), and define
    W(n)=(w(n,0), w(n,1), w(n,2),...w(n,n-1), w(n,n)) recursively by W(n)=W(n-1)*PP(n), where PP(n) is the n X (n+1) matrix given by
...
row 0 ... p(n,0) ... p(n,1) ...... p(n,n-1) ... p(n,n)
row 1 ... 0 ..... p(n-1,0) ..... p(n-1,n-2) .. p(n-1,n-1)
row 2 ... 0 ..... 0 ............ p(n-2,n-3) .. p(n-2,n-2)
...
row n-1 . 0 ..... 0 ............. p(2,1) ..... p(2,2)
row n ... 0 ..... 0 ............. p(1,0) ..... p(1,1)
...
The augmentation of P is here introduced as the triangular array whose n-th row is W(n), for n>=0. The array P may be represented as a sequence of polynomials; viz., row n is then the vector of coefficients:  p(n,0), p(n,1),...,p(n,n), from p(n,0)*x^n+p(n,1)*x^(n-1)+...+p(n,n). For example, (C(n,k)) is represented by ((x+1)^n); using this choice of P (that is, Pascal's triangle), the augmentation of P is calculated one row at a time, either by the above matrix products or by polynomial substitutions in the following manner:
...
row 0 of W:  1, by decree
row 1 of W:  1 augments to 1,1
...polynomial version:  1 -> x+1
row 2 of W:  1,1 augments to 1,3,2
...polynomial version:  x+1 -> (x^2+2x+1)+(x+1)=x^2+3x+2
row 3 to W:  1,3,2 augments to 1,6,11,6
...polynomial version:
    x^2+3x+2 -> (x+1)^3+3(x+1)^2+2(x+1)=(x+1)(x+2)(x+3)
...
Examples of augmented triangular arrays:
(p(n,k)=1) augments to A009766, Catalan triangle.
Catalan triangle augments to A193560.
Pascal triangle augments to A094638, Stirling triangle.
A002260=((k+1)) augments to A023531.
A154325 augments to A033878.
A158405 augments to A193091.
((k!)) augments to A193092.
A094727 augments to A193093.
A130296 augments to A193094.
A004736 augments to A193561.
...
Regarding the specific augmentation W=A193091: w(n,n)=A003169.
From Peter Bala, Aug 02 2012: (Start)
This is the table of g(n,k) in the notation of Carlitz (p. 124). The triangle enumerates two-line arrays of positive integers
............a_1 a_2 ... a_n..........
............b_1 b_2 ... b_n..........
such that
1) max(a_i, b_i) <= min(a_(i+1), b_(i+1)) for 1 <= i <= n-1
2) max(a_i, b_i) <= i for 1 <= i <= n
3) max(a_n, b_n) = k.
See A071948 and A211788 for other two-line array enumerations.
(End)

			The triangle P, at A158405, is given by rows
  1
  1...3
  1...3...5
  1...3...5...7
  1...3...5...7...9...
The augmentation of P is the array W starts with w(0,0)=1, by definition of W.
Successive polynomials (rows of W) arise from P as shown here:
  ...
  1->x+3, so that W has (row 1)=(1,3);
  ...
  x+3->(x^2+3x+5)+3*(x+3), so that W has (row 2)=(1,6,14);
  ...
  x^2+6x+14->(x^3+3x^2+5x+7)+6(x^2+3x+5)+14(x+3), so that (row 3)=(1,9,37,79).
  ...
First 7 rows of W:
  1
  1    3
  1    6    14
  1    9    37    79
  1   12    69   242    494
  1   15   110   516   1658    3294
  1   18   160   928   3870   11764   22952

L. Carlitz, Enumeration of two-line arrays, Fib. Quart., Vol. 11 Number 2 (1973), 113-130.

Cf. A003169, A193092, A193093, A193094.

Cf. A071948, A211788.

p[n_, k_] := 2 k + 1
Table[p[n, k], {n, 0, 5}, {k, 0, n}] (* A158405 *)
m[n_] := Table[If[i <= j, p[n + 1 - i, j - i], 0], {i, n}, {j, n + 1}]
TableForm[m[4]]
w[0, 0] = 1; w[1, 0] = p[1, 0]; w[1, 1] = p[1, 1];
v[0] = w[0, 0]; v[1] = {w[1, 0], w[1, 1]};
v[n_] := v[n - 1].m[n]
TableForm[Table[v[n], {n, 0, 6}]] (* A193091 *)
Flatten[Table[v[n], {n, 0, 9}]]

From Peter Bala, Aug 02 2012: (Start)
T(n,k) = (n-k+1)/n*Sum_{i=0..k} C(n+1,n-k+i+1)*C(2*n+i+1,i) for 0 <= k <= n.
Recurrence equation: T(n,k) = Sum_{i=0..k} (2*k-2*i+1)*T(n-1,i).
(End)

A078937 Square of lower triangular matrix of A056857 (successive equalities in set partitions of n).

Original entry on oeis.org

1, 2, 1, 6, 4, 1, 22, 18, 6, 1, 94, 88, 36, 8, 1, 454, 470, 220, 60, 10, 1, 2430, 2724, 1410, 440, 90, 12, 1, 14214, 17010, 9534, 3290, 770, 126, 14, 1, 89918, 113712, 68040, 25424, 6580, 1232, 168, 16, 1, 610182, 809262, 511704, 204120, 57204, 11844, 1848, 216, 18, 1

Offset: 0

Paul D. Hanna, Dec 18 2002

First column gives A001861 (values of Bell polynomials); row sums gives A035009 (STIRLING transform of powers of 2);
Square of the matrix exp(P)/exp(1) given in A011971. - Gottfried Helms, Apr 08 2007. Base matrix in A011971 and in A056857, second power in this entry, third power in A078938, fourth power in A078939
Riordan array [exp(2*exp(x)-2),x], whose production matrix has e.g.f. exp(x*t)(t+2*exp(x)). [Paul Barry, Nov 26 2008]

			[0] 1;
[1] 2, 1;
[2] 6, 4, 1;
[3] 22, 18, 6, 1;
[4] 94, 88, 36, 8, 1;
[5] 454, 470, 220, 60, 10, 1;
[6] 2430, 2724, 1410, 440, 90, 12, 1;
[7] 14214, 17010, 9534, 3290, 770, 126, 14, 1;
[8] 89918, 113712, 68040, 25424, 6580, 1232, 168, 16, 1;

Cf. A056857, A001861, A035009.
Cf. A078938, A078944, A078945, A000110.
Cf. A078937, A078938, A129323, A129324, A129325, A027710.
Cf. A129327, A129328, A129329, A078944, A129331, A129332, A129333.

# Computes triangle as a matrix M(dim, p).
# A023531 (p=0), A056857 (p=1), this sequence (p=2), A078938 (p=3), ...
with(LinearAlgebra): M := (n, p) -> local j,k; MatrixPower(subs(exp(1) = 1,
MatrixExponential(MatrixExponential(Matrix(n, n, [seq(seq(`if`(j = k + 1, j, 0),
k = 0..n-1), j = 0..n-1)])))), p): M(8, 2);  # Peter Luschny, Mar 28 2024

k=9; m=matpascal(k)-matid(k+1); pe=matid(k+1)+sum(j=1,k,m^j/j!); A=pe^2; A /* Gottfried Helms, Apr 08 2007; amended by Georg Fischer Mar 28 2024 */

PE=exp(matpascal(5))/exp(1); A = PE^2; a(n)=A[n,column] with exact integer arithmetic: PE=exp(matpascal(5)-matid(6)); A = PE^2; a(n)=A[n,1] - Gottfried Helms, Apr 08 2007

Exponential function of 2*Pascal's triangle (taken as a lower triangular matrix) divided by e^2: [A078937] = (1/e^2)*exp(2*[A007318]) = [A056857]^2.

Entry revised by N. J. A. Sloane, Apr 25 2007

a(38) corrected by Georg Fischer, Mar 28 2024

A073424 Triangle read by rows: T(m,n) = parity of 0^n + 0^m, n = 0,1,2,3 ..., m = 0,1,2,3, ... n.

Original entry on oeis.org

0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1

Offset: 0

Jeremy Gardiner, Jul 30 2002

Parity of the sums of two powers of any even number.

			a(3) = 1 because (2k)^2 + (2k)^0 = 4k^2 + 1 is odd.
Triangle begins :
  0
  1, 0
  1, 0, 0
  1, 0, 0, 0
  1, 0, 0, 0, 0
  1, 0, 0, 0, 0, 0
  1, 0, 0, 0, 0, 0, 0
  1, 0, 0, 0, 0, 0, 0, 0
  1, 0, 0, 0, 0, 0, 0, 0, 0
  1, 0, 0, 0, 0, 0, 0, 0, 0, 0 - _Philippe Deléham_, Feb 11 2012

Michael De Vlieger, Table of n, a(n) for n = 0..11475 (rows 0 <= n <= 150).
Franck Ramaharo, A generating polynomial for the pretzel knot, arXiv:1805.10680 [math.CO], 2018.

Cf. A000035, A000217, A023531, A010054, A073423.

0, seq(op([1,0$n]), n=1..20); # Robert Israel, Mar 01 2016

Array[If[# == 1, {0}, PadRight[{1}, #]] &, 14] // Flatten (* or *)
Unprotect[Power]; Power[0, 0] = 1; Protect[Power]; Table[0^m + 0^n - 2 Boole[m == n == 0], {n, 0, 14}, {m, 0, n}] // Flatten (* Michael De Vlieger, Aug 22 2018 *)

from math import isqrt
def A073424(n): return int((k:=n<<1)==(m:=isqrt(k))*(m+1)) if n else 0 # Chai Wah Wu, Nov 09 2024

a(n) = parity [ (2k)^n + (2k)^m, n = 0, 1, 2, 3 ..., m = 0, 1, 2, 3, ... n ]
T(n,0) = 1- 0^n, T(n,k) = 0 for k>0. - Philippe Deléham, Feb 11 2012
G.f.: Theta_2(0,sqrt(x))/(2*x^(1/8))-1, where Theta_2 is a Jacobi theta function. - Robert Israel, Mar 01 2016
For n>0, a(n) = 1 if and only if n is in A000217. - Chai Wah Wu, Nov 09 2024

A194702 Triangle read by rows: T(k,m) = number of occurrences of k in the last section of the set of partitions of (2 + m).

Original entry on oeis.org

2, 0, 2, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1

Offset: 1

Omar E. Pol, Feb 05 2012

Sub-triangle of A182703 and also of A194812. Note that the sum of every row is also the number of partitions of 2. For further information see A182703 and A135010.

			Triangle begins:
2,
0, 2,
1, 0, 1,
0, 1, 0, 1,
0, 0, 1, 0, 1,
0, 0, 0, 1, 0, 1,
0, 0, 0, 0, 1, 0, 1,
0, 0, 0, 0, 0, 1, 0, 1,
0, 0, 0, 0, 0, 0, 1, 0, 1,
0, 0, 0, 0, 0, 0, 0, 1, 0, 1,
...
For k = 1 and  m = 1; T(1,1) = 2 because there are two parts of size 1 in the last section of the set of partitions of 3, since 2 + m = 3, so a(1) = 2. For k = 2 and m = 1; T(2,1) = 0 because there are no parts of size 2 in the last section of the set of partitions of 3, since 2 + m = 3, so a(2) = 0.

Always the sum of row k = p(2) = A000041(n) = 2.
The first (0-10) members of this family of triangles are A023531, A129186, this sequence, A194703-A194710.
Cf. A135010, A138121, A182712-A182714, A194812.

T(k,m) = A182703(2+m,k), with T(k,m) = 0 if k > 2+m.

T(k,m) = A194812(2+m,k).

A194710 Triangle read by rows: T(k,m) = number of occurrences of k in the last section of the set of partitions of (10 + m).

Original entry on oeis.org

42, 15, 27, 10, 14, 18, 5, 10, 10, 17, 4, 5, 8, 10, 15, 2, 5, 4, 8, 9, 14, 2, 2, 4, 5, 7, 9, 13, 1, 2, 2, 4, 4, 8, 8, 13, 1, 1, 2, 2, 4, 4, 7, 9, 12, 0, 1, 1, 2, 2, 4, 4, 7, 8, 13, 1, 0, 1, 1, 2, 2, 4, 4, 7, 8, 12, 0, 1, 0, 1, 1, 2, 2, 4, 4, 7, 8, 12

Offset: 1

Omar E. Pol, Feb 05 2012

Sub-triangle of A182703 and also of A194812. Note that the sum of row k is also the number of partitions of 10. For further information see A182703 and A135010.

			Triangle begins:
  42;
  15, 27;
  10, 14, 18;
   5, 10, 10, 17;
   4,  5,  8, 10, 15;
   2,  5,  4,  8,  9, 14;
   2,  2,  4,  5,  7,  9, 13;
   1,  2,  2,  4,  4,  8,  8, 13;
   1,  1,  2,  2,  4,  4,  7,  9, 12;
   0,  1,  1,  2,  2,  4,  4,  7,  8, 13;
   1,  0,  1,  1,  2,  2,  4,  4,  7,  8, 12;
   0,  1,  0,  1,  1,  2,  2,  4,  4,  7,  8, 12;
   0,  0,  1,  0,  1,  1,  2,  2,  4,  4,  7,  8, 12;
   0,  0,  0,  1,  0,  1,  1,  2,  2,  4,  4,  7,  8, 12;
  ...
For k = 1 and m = 1; T(1,1) = 42 because there are 42 parts of size 1 in the last section of the set of partitions of 11, since 10 + m = 11, so a(1) = 42. For k = 2 and m = 1; T(2,1) = 15 because there are 15 parts of size 2 in the last section of the set of partitions of 11, since 10 + m = 11, so a(2) = 15.

Always the sum of row k = p(10) = A000041(10) = 42.
The first (0-10) members of this family of triangles are A023531, A129186, A194702-A194709, this sequence.
Cf. A002865, A135010, A138121, A194812.

T(k,m) = A182703(10+m,k), with T(k,m) = 0 if k > 10+m.
T(k,m) = A194812(10+m,k).
Beginning with row k=11 each row starts with (k-11) 0's and ends with the subsequence 1, 0, 1, 1, 2, 2, 4, 4, 7, 8, 12, the initial terms of A002865. - Alois P. Heinz, Feb 15 2012

A190405 Decimal expansion of Sum_{k>=1} (1/2)^T(k), where T=A000217 (triangular numbers); based on column 1 of the natural number array, A000027.

Original entry on oeis.org

6, 4, 1, 6, 3, 2, 5, 6, 0, 6, 5, 5, 1, 5, 3, 8, 6, 6, 2, 9, 3, 8, 4, 2, 7, 7, 0, 2, 2, 5, 4, 2, 9, 4, 3, 4, 2, 2, 6, 0, 6, 1, 5, 3, 7, 9, 5, 6, 7, 3, 9, 7, 4, 7, 8, 0, 4, 6, 5, 1, 6, 2, 2, 3, 8, 0, 1, 4, 4, 6, 0, 3, 7, 3, 3, 3, 5, 1, 7, 7, 5, 6, 0, 0, 3, 6, 4, 1, 7, 1, 6, 2, 3, 3, 5, 9, 1, 3, 3, 0, 8, 6, 0, 8, 9, 7, 3, 5, 3, 1, 6, 3, 4, 3, 6, 1, 9, 4, 6, 1

Offset: 0

Clark Kimberling, May 10 2011

See A190404.
Binary expansion is .1010010001... (A023531). - Rick L. Shepherd, Jan 05 2014
From Amiram Eldar, Dec 07 2020: (Start)
This constant is not a quadratic irrational (Duverney, 1995).
The Engel expansion of this constant are the powers of 2 (A000079) above 1. (End)

			0.64163256065515386629...

Danny Rorabaugh, Table of n, a(n) for n = 0..10000
Daniel Duverney, Sommes de deux carrés et irrationalité de valeurs de fonctions thêta, Comptes rendus de l'Académie des sciences, Série 1, Mathématique, Vol. 320, No. 9 (1995), pp. 1041-1044.

A190404: (1/2)(1 + Sum_{k>=1} (1/2)^T(k)), where T = A000217 (triangular numbers).
A190405: Sum_{k>=1} (1/2)^T(k), where T = A000217 (triangular numbers).
A190406: Sum_{k>=1} (1/2)^S(k-1), where S = A001844 (centered square numbers).
A190407: Sum_{k>=1} (1/2)^V(k), where V = A058331 (1 + 2*k^2).
Cf. A000079.

RealDigits[EllipticTheta[2, 0, 1/Sqrt[2]]/2^(7/8) - 1, 10, 120] // First (* Jean-François Alcover, Feb 12 2013 *)
RealDigits[Total[(1/2)^Accumulate[Range[50]]],10,120][[1]] (* Harvey P. Dale, Oct 18 2013 *)
(* See also A190404 *)

th2(x)=2*x^.25 + 2*suminf(n=1,x^(n+1/2)^2)
th2(sqrt(.5))/2^(7/8)-1 \\ Charles R Greathouse IV, Jun 06 2016

def A190405(b):  # Generate the constant with b bits of precision
    return N(sum([(1/2)^(j*(j+1)/2) for j in range(1,b)]),b)
A190405(409) # Danny Rorabaugh, Mar 25 2015

A318146 Coefficients of the Omega polynomials of order 2, triangle T(n,k) read by rows with 0<=k<=n.

Original entry on oeis.org

1, 0, 1, 0, -2, 3, 0, 16, -30, 15, 0, -272, 588, -420, 105, 0, 7936, -18960, 16380, -6300, 945, 0, -353792, 911328, -893640, 429660, -103950, 10395, 0, 22368256, -61152000, 65825760, -36636600, 11351340, -1891890, 135135

Offset: 0

Peter Luschny, Aug 22 2018

The name 'Omega polynomial' is not a standard name. The Omega numbers are the coefficients of the Omega polynomials, the associated Omega numbers are the weights of P(m, k) in the recurrence formula given below.

The signed Euler secant numbers appear as values at x=-1 and the signed Euler tangent numbers as the coefficients of x.

			Row n in the triangle below is the coefficient list of OmegaPolynomial(2, n). For other cases than m = 2 see the cross-references.
[0] [1]
[1] [0,        1]
[2] [0,       -2,         3]
[3] [0,       16,       -30,       15]
[4] [0,     -272,       588,     -420,       105]
[5] [0,     7936,    -18960,    16380,     -6300,      945]
[6] [0,  -353792,    911328,  -893640,    429660,  -103950,    10395]
[7] [0, 22368256, -61152000, 65825760, -36636600, 11351340, -1891890, 135135]

Peter Luschny, Table of the first 63 rows.

Variant is A088874 (unsigned).
T(n,1) = A000182(n), T(n,n) = A001147(n).
All row sums are 1, alternating row sums are A028296 (A000364).
A023531 (m=1), this seq (m=2), A318147 (m=3), A318148 (m=4).
Associated Omega numbers: A318254 (m=2), A318255 (m=3).
Coefficients of x for Omega polynomials of all orders are in A318253.

OmegaPolynomial := proc(m, n) local Omega;
Omega := m -> hypergeom([], [seq(i/m, i=1..m-1)], (z/m)^m):
series(Omega(m)^x, z, m*(n+1)):
sort(expand((m*n)!*coeff(%, z, n*m)), [x], ascending) end:
CL := p -> PolynomialTools:-CoefficientList(p, x):
FL := p -> ListTools:-Flatten(p):
FL([seq(CL(OmegaPolynomial(2, n)), n=0..8)]);
# Alternative:
ser := series(sech(z)^(-x), z, 24): row := n -> n!*coeff(ser, z, n):
seq(seq(coeff(row(2*n), x, k), k=0..n), n=0..6); # Peter Luschny, Jul 01 2019

OmegaPolynomial[m_,n_] :=  Module [{ },
S = Series[MittagLefflerE[m,z]^x, {z,0,10}];
Expand[(m n)! Coefficient[S,z,n]] ]
Table[CoefficientList[OmegaPolynomial[2,n],x], {n,0,7}] // Flatten
(* Second program: *)
T[n_, k_] := (2n)! SeriesCoefficient[Sech[z]^-x, {z, 0, 2n}, {x, 0, k}];
Table[T[n, k], {n, 0, 7}, {k, 0, n}] // Flatten (* Jean-François Alcover, Jul 23 2019, after Peter Luschny *)

def OmegaPolynomial(m, n):
    R = ZZ[x]; z = var('z')
    f = [i/m for i in (1..m-1)]
    h = lambda z: hypergeometric([], f, (z/m)^m)
    return R(factorial(m*n)*taylor(h(z)^x, z, 0, m*n + 1).coefficient(z, m*n))
[list(OmegaPolynomial(2, n)) for n in (0..6)]
# Recursion over the polynomials, returns a list of the first len polynomials:
def OmegaPolynomials(m, len, coeffs=true):
    R = ZZ[x]; B = [0]*len; L = [R(1)]*len
    for k in (1..len-1):
        s = x*sum(binomial(m*k-1, m*(k-j))*B[j]*L[k-j] for j in (1..k-1))
        B[k] = c = 1 - s.subs(x=1)
        L[k] = R(expand(s + c*x))
    return [list(l) for l in L] if coeffs else L
print(OmegaPolynomials(2, 6))

OmegaPolynomial(m, n) = (m*n)! [z^n] E(m, z)^x where E(m, z) is the Mittag-Leffler function.
OmegaPolynomial(m, n) = (m*n)!*[z^(n*m)] H(m, z)^x where H(m, z) = hypergeom([], [seq(i/m, i=1..m-1)], (z/m)^m).
The Omega polynomials can be computed by the recurrence P(m, 0) = 1 and for n >= 1 P(m, n) = x * Sum_{k=0..n-1} binomial(m*n-1, m*k)*T(m, n-k)*P(m, k) where T(m, n) are the generalized tangent numbers A318253. A separate computation of the T(m, n) can be avoided, see the Sage implementation below for the details.
T(n, k) = [x^k] (2*n)! [z^(2*n)] sech(z)^(-x). - Peter Luschny, Jul 01 2019

Previous Showing 51-60 of 93 results. Next

cp's OEIS Frontend

A030528 Triangle read by rows: a(n,k) = binomial(k,n-k).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Formula

Extensions

A007401 Add n-1 to n-th term of 'n appears n times' sequence (A002024).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

PARI

Python

Formula

A001614 Connell sequence: 1 odd, 2 even, 3 odd, ...

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Python

Formula

Extensions

A193091 Augmentation of the triangular array A158405. See Comments.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A078937 Square of lower triangular matrix of A056857 (successive equalities in set partitions of n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

PARI

Formula

Extensions

A073424 Triangle read by rows: T(m,n) = parity of 0^n + 0^m, n = 0,1,2,3 ..., m = 0,1,2,3, ... n.

Views

Author

Keywords

Comments

Examples

Links