A142963 -id:A142963 - cp's OEIS frontend

A156920 Triangle of the normalized A142963 and A156919 sequences.

1, 1, 1, 1, 5, 1, 1, 15, 18, 1, 1, 37, 129, 58, 1, 1, 83, 646, 877, 179, 1, 1, 177, 2685, 8030, 5280, 543, 1, 1, 367, 10002, 56285, 82610, 29658, 1636, 1, 1, 749, 34777, 335162, 919615, 756218, 159742, 4916, 1

Offset: 0

Johannes W. Meijer, Feb 20 2009

The originator sequences are A142963 and A156919.
The Flower Triangle seems to be an appropriate name for the triangular array of this sequence. The zero patterns of the Flower Polynomials of the first, see A156921, the second, see A156925, the third, see A156927, and the fourth kind, see A156933, look like flowers.
The first Maple program generates the Flower Triangle sequence.
The second program generates the Right Hand Columns sequences and the third one generates the Left Hand Column sequences. For an explanation of these two algorithms see A142963.

			The first few rows of the triangle are:
  [1]
  [1, 1]
  [1, 5, 1]
  [1, 15, 18, 1]
  [1, 37, 129, 58, 1]
  [1, 83, 646, 877, 179, 1]

Shi-Mei Ma, Some combinatorial sequences associated with context-free grammars, arXiv:1208.3104v2 [math.CO]. - From N. J. A. Sloane, Aug 21 2012

Originator sequences A142963, A156919.
Related sequences A156921, A156925, A156927, A156933.
Left hand column sequences A050488, A142965, A142966, A142968.
Right hand column sequences A000340, A156922, A156923, A156924.
Row sums A014307(n+1).

A156920 := proc(n,m): if n=m then 1; elif m=0 then 1 ; elif m<0 or m>n then 0; else (m+1)*procname(n-1, m)+(2*n-2*m+1)*procname(n-1, m-1) ; end if; end proc: seq(seq(A156920(n, m), m=0..n), n=0..8);
RHCnr:=5; RHCmax:=10; RHCend:=RHCnr+RHCmax: for k from RHCnr to RHCend do for n from 0 to k do S2[k,n]:=sum((-1)^(n+i)*binomial(n,i)*i^k/n!,i=0..n) end do: G(k,x):= sum(S2[k,p]*((2*p)!/p!) *x^p/(1-4*x)^(p+1),p=0..k)/(((-1)^(k+1)*2*x)/(-1+4*x)^(k+1)): fx:=simplify(G(k,x)): nmax:=degree(fx); RHC[k-RHCnr+1]:= coeff(fx,x,k-RHCnr)/2^(k-RHCnr) end do: a:=n-> RHC[n]: seq(a(n), n=1..RHCend-RHCnr);
LHCnr:=5; LHCmax:=10: LHCend:=LHCnr+LHCmax: for k from LHCnr to LHCend do for n from 0 to k do S2[k,n]:=sum((-1)^(n+i)*binomial(n,i)*i^k/n!,i=0..n) end do: G(k,x):= sum(S2[k,p]*((2*p)!/p!)*x^p/(1-4*x)^(p+1),p=0..k)/ (((-1)^(k+1)*2*x)/(-1+4*x)^(k+1)): fx:=simplify(G(k,x)): nmax:=degree(fx); for n from 0 to nmax do d[n]:= coeff(fx,x,n)/2^n end do: LHC[n]:=d[LHCnr-1] end do: a:=n-> LHC[n]: seq(a(n), n=LHCnr..LHCend-1);

T[, 0] = 1; T[n, n_] = 1; T[n_, m_] := T[n, m] = (m + 1)*T[n - 1, m] + (2*n - 2*m + 1)*T[n - 1, m - 1];
Table[T[n, m], {n, 0, 8}, {m, 0, n}] // Flatten (* Jean-François Alcover, Nov 14 2017 *)

T(n,m) = (m+1)*T(n-1,m) + (2*n-2*m+1)*T(n-1,m-1) with T(n,m=0) = 1 and T(n,n) = 1, n>=0 and 0 <= m <= n.
From Peter Bala, Jul 22 2012: (Start)
T(n,k) = 1/(2^(n-k))*A156919(n,k).
E.g.f.: 1 + t*x + (t+t^2)*x^2/2! + (t+5*t^2+t^3)*x^3/3! + ... = sqrt(E(x,2*t)), where E(x,t) = (1-t)*exp(x*t)/(exp(x*t)-t*exp(x)) = 1 + t*x + (t+t^2)*x^2/2! + (t+4*t^2+t^3)*x^3/3! + ... is the e.g.f. for the Eulerian numbers A008292.
The row polynomials R(n,x) satisfy 1/sqrt(1-2*x)*(x*d/dx)^n(1/sqrt(1-2*x)) = R(n,x)/(1-2*x)^(n+1). (End)

Minor edits by Johannes W. Meijer, Sep 28 2011

A142965 One fourth of third column (m=2) of triangle A142963.

Original entry on oeis.org

1, 18, 129, 646, 2685, 10002, 34777, 115566, 372453, 1175290, 3654369, 11245110, 34349005, 104373282, 315969705, 954002878, 2874983541, 8652474378, 26015617585, 78169534470, 234766551261, 704840716978, 2115654610809, 6349329417486, 19052920751365, 57169029907482

Offset: 0

Wolfdieter Lang, Sep 15 2008

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (10, -40, 82, -91, 52, -12).

Column m=1: 2*A142964; m=3: 8*A142966.
From Johannes W. Meijer, Feb 20 2009: (Start)
Cf. A156925.
Equals A156920(n+2,2).
Equals A156919(n+2,2)/2^n.
(End)

[35/2+2*n^2+12*n-84*2^n-24*2^n*n+135/2*3^n: n in [0..25]]; // Vincenzo Librandi, Jun 18 2017

LinearRecurrence[{10,-40,82,-91,52,-12}, {1,18,129,646,2685,10002},30] (* or *) CoefficientList[Series[(1+8x-11x^2-6x^3)/((x-1)^3 (2x-1)^2 (3x-1)),{x,0,30}],x] (* Harvey P. Dale, Apr 24 2011 *)

a(n) = A142963(n+3,2)/4.
From Johannes W. Meijer, Feb 20 2009: (Start)
a(n) = 10a(n-1) - 40a(n-2) + 82a(n-3) - 91a(n-4) + 52a(n-5) - 12a(n-6).
a(n) = 35/2 + 2*n^2 + 12*n - 84*2^n - 24*2^n*n + 135/2*3^n
G.f.: (1 + 8*z - 11*z^2 - 6*z^3)/((1-z)^3*(1-2*z)^2*(1-3*z)).
(End)

A142966 Fourth column (m=3) of triangle A142963 divided by 8.

Original entry on oeis.org

1, 58, 877, 8030, 56285, 335162, 1792749, 8904486, 41949645, 190129090, 837258109, 3607669966, 15289404989, 63975698570, 265065915725, 1089837752118, 4454225465325, 18119738464530, 73441531708765, 296814738679390, 1196884383319261, 4817845684107098

Offset: 0

Wolfdieter Lang, Sep 15 2008

Cf. A142963.
Column m=2: 4*A142965.
From Johannes W. Meijer, Feb 20 2009: (Start)
Cf. A156925.
Equals A156920(n+3,3).
Equals A156919(n+3,3)/2^n.
(End)

a(n) = A142963(n+4,3)/8.
From Johannes W. Meijer, Feb 20 2009: (Start)
a(n) = 20a(n-1) - 175*a(n-2) + 882*a(n-3) - 2835*a(n-4) + 6072*a(n-5) - 8777*a(n-6) + 8458*a(n-7) - 5204*a(n-8) + 1848*a(n-9) - 288*a(n-10).
a(n) = -(105/2) - (143/3)*n - 14*n^2 - (4/3)*n^3 + 756*2^n + 48*2^n*n^2 + 384*2^n*n - (3645/2)*3^n - 405*3^n*n + 1120*4^n.
G.f.: (1 + 38*z - 108*z^2 - 242*z^3 + 839*z^4 - 444*z^5 - 180*z^6)/((1-z)^4*(1-2*z)^3*(1-3*z)^2*(1-4*z)).
(End)

A142968 Fifth column (m=4) of triangle A142963 divided by 16=2^4.

Original entry on oeis.org

1, 179, 5280, 82610, 919615, 8284857, 64730022, 457217400, 2999230965, 18608607535, 110625457964, 636103699038, 3562753619915, 19541111960965, 105392471360850, 560747327119908, 2950726075955265, 15387821226034875, 79656442803398680, 409857988825489610

Offset: 0

Wolfdieter Lang, Sep 15 2008

Column m=3: 8*A142966.
From Johannes W. Meijer, Feb 20 2009: (Start)
Cf. A156925.
Equals A156920(n+4,4).
Equals A156919(n+4,4)/2^n.
(End)

a(n) = A142963(n+5,3)/2^4.
From Johannes W. Meijer, Feb 20 2009: (Start)
a(n) = 35a(n-1) - 560a(n-2) + 5432a(n-3) - 35714a(n-4) + 168542a(n-5) - 589632a(n-6) + 1556776a(n-7) - 3126949a(n-8) + 4777591a(n-9) - 5506936a(n-10) + 4703032a(n-11) - 2881136a(n-12) + 1195632a(n-13) - 300672a(n-14) + 34560a(n-15).
a(n) = (1155/8) + (472/3)*n - 5544*2^n + (120285/4)*3^n - 49280*4^n + (196875/8)*5^n - 64*2^n*n^3 - 864*2^n*n^2 - 3824*2^n*n + (187/3)*n^2 + 1215*3^n*n^2 + 12150*3^n*n - 8960*4^n*n + (32/3)*n^3 + (2/3)*n^4.
G.f.: (1 + 144*z - 425*z^2 - 7382*z^3 + 48451*z^4 - 96764*z^5 - 2559*z^6 + 257002*z^7 - 312444*z^8 + 88344*z^9 + 30240*z^10)/((1-z)^5*(1-2*z)^4*(1-3*z)^3*(1-4*z)^2*(1-5*z)).
(End)

A142967 Row sums of triangle A142963.

Original entry on oeis.org

1, 3, 15, 111, 1071, 12663, 177255, 2866671, 52587711, 1078805223, 24470577495, 608113846431, 16429992037551, 479502707791383, 15032820820737735, 503852219871917391, 17978716725920562591, 680458944566818819143, 27227452811905815729975, 1148414905826479180087551

Offset: 1

Wolfdieter Lang, Sep 15 2008

Cf. A142963, A211399.

a(n) = Sum_{m=0..n-1} A142963(n,m).
a(n) = Sum_{k=1..n} A211399(n,k)*2^(k-1). - Philippe Deléham, Feb 12 2013
G.f.: 1 + 2*Sum_{n = 1..inf} a(n)*x^n = 1/(1-2*x/(1-x/(1-2*3*x/(1-2*x/(1-2*5*x/(1-3*x/(1-2*7*x/(1-4*x/(1-...))))))))) (continued fraction). - Philippe Deléham, Feb 12 2013

A000340 a(0)=1, a(n) = 3*a(n-1) + n + 1.

Original entry on oeis.org

1, 5, 18, 58, 179, 543, 1636, 4916, 14757, 44281, 132854, 398574, 1195735, 3587219, 10761672, 32285032, 96855113, 290565357, 871696090, 2615088290, 7845264891, 23535794695, 70607384108, 211822152348, 635466457069

Offset: 0

N. J. A. Sloane, Simon Plouffe

From Johannes W. Meijer, Feb 20 2009: (Start)
Second right hand column (n-m=1) of the A156920 triangle.
The generating function of this sequence enabled the analysis of the polynomials A156921 and A156925.
(End)
Partial sums of A003462, and thus the second partial sums of A000244 (3^n). Also column k=2 of A106516. - John Keith, Jan 04 2022

			G.f. = 1 + 5*x + 18*x^2 + 58*x^3 + 179*x^4 + 543*x^5 + 1636*x^6 + ...

F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 260.
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).

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Dillan Agrawal, Selena Ge, Jate Greene, Tanya Khovanova, Dohun Kim, Rajarshi Mandal, Tanish Parida, Anirudh Pulugurtha, Gordon Redwine, Soham Samanta, and Albert Xu, Chip-Firing on Infinite k-ary Trees, arXiv:2501.06675 [math.CO], 2025. See pp. 9, 18.
Shaoshi Chen, Hanqian Fang, Sergey Kitaev, and Candice X.T. Zhang, Patterns in Multi-dimensional Permutations, arXiv:2411.02897 [math.CO], 2024. See p. 7.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 389
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
László Tóth, On Schizophrenic Patterns in b-ary Expansions of Some Irrational Numbers, arXiv:2002.06584 [math.NT], 2020. Mentions this sequence. See also Proc. Amer. Math. Soc. 148 (2020), 461-469.
Index entries for linear recurrences with constant coefficients, signature (5,-7,3).

From Johannes W. Meijer, Feb 20 2009: (Start)
Cf. A156921, A156925, A156927, A156933. Other columns A156922, A156923, A156924.
Equals A156920 second right hand column.
Equals A142963 second right hand column divided by 2^n.
Equals A156919 second right hand column divided by 2.
(End)
Cf. A014915.
Equals column k=1 of A008971 (shifted). - Jeremy Dover, Jul 11 2021
Cf. A000340, A003462 (first differences), A106516.

[(3^(n+2)-2*n-5)/4: n in [0..30]]; // Vincenzo Librandi, Aug 15 2011

a[ -1]:=0:a[0]:=1:for n from 1 to 50 do a[n]:=4*a[n-1]-3*a[n-2]+1 od: seq(a[n],n=0..50); # Miklos Kristof, Mar 09 2005
A000340:=-1/(3*z-1)/(z-1)**2; # conjectured by Simon Plouffe in his 1992 dissertation

a[ n_] := MatrixPower[ {{1, 0, 0}, {1, 1, 0}, {1, 1, 3}}, n + 1][[3, 1]]; (* Michael Somos, May 28 2014 *)
RecurrenceTable[{a[0]==1,a[n]==3a[n-1]+n+1},a,{n,30}] (* or *) LinearRecurrence[{5,-7,3},{1,5,18},30] (* Harvey P. Dale, Jan 31 2017 *)

G.f.: 1/((1-3*x)*(1-x)^2).
a(n) = (3^(n+2) - 2*n - 5)/4.
a(n) = Sum_{k=0..n+1} (n-k+1)*3^k = Sum_{k=0..n+1} k*3^(n-k+1). - Paul Barry, Jul 30 2004
a(n) = Sum_{k=0..n} binomial(n+2, k+2)*2^k. - Paul Barry, Jul 30 2004
a(-1)=0, a(0)=1, a(n) = 4*a(n-1) - 3*a(n-2) + 1. - Miklos Kristof, Mar 09 2005
a(n) = 5*a(n-1) - 7*a(n-2) + 3*a(n-3). - Johannes W. Meijer, Feb 20 2009
a(-2 - n) = 3^-n * A014915(n). - Michael Somos, May 28 2014
E.g.f.: exp(x)*(9*exp(2*x) - 2*x - 5)/4. - Stefano Spezia, Nov 09 2024

A050488 a(n) = 3(2^n-1) - 2n.

Original entry on oeis.org

0, 1, 5, 15, 37, 83, 177, 367, 749, 1515, 3049, 6119, 12261, 24547, 49121, 98271, 196573, 393179, 786393, 1572823, 3145685, 6291411, 12582865, 25165775, 50331597, 100663243, 201326537, 402653127, 805306309, 1610612675, 3221225409, 6442450879, 12884901821, 25769803707

Offset: 0

James Sellers, Dec 26 1999

Number of words of length n+1 where first element is from {0,1,2}, other elements are from {0,1} and sequence does not decrease (for n=2 there are 3*2^2 sequences, but 000, 100, 110, 111, 200, 210, 211 decrease, so a(2) = 12-7 = 5).
Number of subgroups of C_(2^n) X C_(2^n) (see A060724).
Starting with 1 = row sums of triangle A054582. - Gary W. Adamson, Jun 23 2008
Starting with "1" equals the eigensequence of a triangle with integer squares (1, 4, 9, 16, ...) as the left border and the rest 1's. - Gary W. Adamson, Jul 24 2010
(1 + 2x + 2x^2 + 2x^3 + ...)*(1 + 3x + 7x^2 + 15x^3 + ...) = (1 + 5x + 15x^2 + 37x^3 + ...). - Gary W. Adamson, Mar 14 2012
The partial sums of A033484. - J. M. Bergot, Oct 03 2012
Binomial transform is 0, 1, 7, 33, ... (shifted A066810); inverse binomial transform is 0, 1, 3, 3, ... (3 repeated). - R. J. Mathar, Oct 05 2012
Define a triangle by T(n,0) = n*(n+1) + 1, T(n,n) = n + 1, and T(r,c) = T(r-1,c-1) + T(r-1,c) otherwise; then a(n+1) is the sum of the terms of row n. - J. M. Bergot, Mar 30 2013
Starting with "1" are also the antidiagonal sums of the array formed by partial sums of integer squares (1, 4, 9, 16, ...). - Luciano Ancora, Apr 24 2015
Sums of 2 adjacent terms in diagonal k=2 of Eulerian triangle A008292. I.e., T(n,2)+T(n-1,2) for n > 0. Also, 4th NW-SE diagonal of A126277. In other words, a(n) = A000295(n) + A000295(n+1). - Gregory Gerard Wojnar, Sep 30 2018

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
Adam Buck, Jennifer Elder, Azia A. Figueroa, Pamela E. Harris, Kimberly Harry, and Anthony Simpson, Flattened Stirling Permutations, arXiv:2306.13034 [math.CO], 2023. See p. 14.
Tamas Lengyel, On p-adic properties of the Stirling numbers of the first kind, Journal of Number Theory, 148 (2015) 73-94.
Index entries for linear recurrences with constant coefficients, signature (4,-5,2).

A050487(2^m-1).
Equals (1/2) A051667.
Cf. A000079, A000225, A000295, A005408, A008292, A033484, A054852, A060724, A066810, A125165, A126277, A142963, A156919, A156920, A156925.

List([0..30],n->3*(2^n-1)-2*n); # Muniru A Asiru, Oct 26 2018

a050488 n = sum $ zipWith (*) a000079_list (reverse $ take n a005408_list)
-- Reinhard Zumkeller, Jul 24 2015

[3*(2^n-1) - 2*n: n in [0..30]]; // G. C. Greubel, Oct 23 2018

seq(coeff(series(x*(x+1)/((1-x)^2*(1-2*x)),x,n+1), x, n), n = 0 .. 30); # Muniru A Asiru, Oct 26 2018

Table[3(2^n-1)-2n,{n,0,30}] (* or *) LinearRecurrence[{4,-5,2}, {0,1,5}, 40] (* Harvey P. Dale, Apr 09 2018 *)

a(n)=3*(2^n-1)-2*n \\ Charles R Greathouse IV, Sep 24 2015

for n in range(0, 30): print(3*(2**n-1) - 2*n, end=', ') # Stefano Spezia, Oct 27 2018

Row sums of A125165: (1, 5, 15, 37, ...). Binomial transform of [1, 4, 6, 6, 6, ...] = [1, 5, 15, 37, ...]. 4th diagonal from the right of A126777 = (1, 5, 15, ...). - Gary W. Adamson, Dec 23 2006
a(n) = 2*a(n-1) + (2n-1). - Gary W. Adamson, Sep 30 2007
From Johannes W. Meijer, Feb 20 2009: (Start)
a(n+1) = A156920(n+1,1).
a(n+1) = A156919(n+1,1)/2^n.
a(n+1) = A142963(n+2,1)/2.
a(n) = 4a(n-1) - 5a(n-2) + 2a(n-3) for n>2 with a(0) = 0, a(1) = 1, a(2) = 5.
G.f.: z*(1+z)/((1-z)^2*(1-2*z)).
(End)
a(n) = 2*n + 2*a(n-1) - 1 (with a(0)=0). - Vincenzo Librandi, Aug 06 2010
a(n+1) = Sum_{k=0..n} A000079(k) * A005408(n-k), convolution of the powers of 2 with the odd numbers. - Reinhard Zumkeller, Mar 08 2012
E.g.f.: exp(x)*(3*exp(x) - 2*x - 3). - Stefano Spezia, May 15 2023

A156919 Table of coefficients of polynomials related to the Dirichlet eta function.

Original entry on oeis.org

1, 2, 1, 4, 10, 1, 8, 60, 36, 1, 16, 296, 516, 116, 1, 32, 1328, 5168, 3508, 358, 1, 64, 5664, 42960, 64240, 21120, 1086, 1, 128, 23488, 320064, 900560, 660880, 118632, 3272, 1, 256, 95872, 2225728

Offset: 0

Johannes W. Meijer, Feb 20 2009, Jun 24 2009

Essentially the same as A185411. Row reverse of A185410. - Peter Bala, Jul 24 2012
The SF(z; n) formulas, see below, were discovered while studying certain properties of the Dirichlet eta function.
From Peter Bala, Apr 03 2011: (Start)
Let D be the differential operator 2*x*d/dx. The row polynomials of this table come from repeated application of the operator D to the function g(x) = 1/sqrt(1 - x). For example,
  D(g) = x*g^3
  D^2(g) = x*(2 + x)*g^5
  D^3(g) = x*(4 + 10*x + x^2)*g^7
  D^4(g) = x*(8 + 60*x + 36*x^2 + x^3)*g^9.
Thus this triangle is analogous to the triangle of Eulerian numbers A008292, whose row polynomials come from the  repeated application of the operator x*d/dx to the function 1/(1 - x). (End)

			The first few rows of the triangle are:
  [1]
  [2, 1]
  [4, 10, 1]
  [8, 60, 36, 1]
  [16, 296, 516, 116, 1]
The first few P(z;n) are:
  P(z; n=0) = 1
  P(z; n=1) = 2 + z
  P(z; n=2) = 4 + 10*z + z^2
  P(z; n=3) = 8 + 60*z + 36*z^2 + z^3
The first few SF(z;n) are:
  SF(z; n=0) = (1/2)*(1)/(1-z)^(3/2);
  SF(z; n=1) = (1/4)*(2+z)/(1-z)^(5/2);
  SF(z; n=2) = (1/8)*(4+10*z+z^2)/(1-z)^(7/2);
  SF(z; n=3) = (1/16)*(8+60*z+36*z^2+z^3)/(1-z)^(9/2);
In the Savage-Viswanathan paper, the coefficients appear as
  1;
  1,    2;
  1,   10,     4;
  1,   36,    60,     8;
  1,  116,   516,   296,    16;
  1,  358,  3508,  5168,  1328,   32;
  1, 1086, 21120, 64240, 42960, 5664, 64;
  ...

D. H. Lehmer, Interesting Series Involving the Central Binomial Coefficient, Am. Math. Monthly 92 (1985) 449-457, Polynomial V in eq (17). [R. J. Mathar, Feb 24 2009]
Shi-Mei Ma, A family of two-variable derivative polynomials for tangent and secant, arXiv: 1204.4963v3 [math.CO], 2012.
Shi-Mei Ma, A family of two-variable derivative polynomials for tangent and secant, El J. Combinat. 20 (1) (2013) P11
S.-M. Ma and T. Mansour, The 1/k-Eulerian polynomials and k-Stirling permutations, arXiv preprint arXiv:1409.6525 [math.CO], 2014.
S.-M. Ma and Y.-N. Yeh, Stirling permutations, cycle structures of permutations and perfect matchings, arXiv preprint arXiv:1503.06601 [math.CO], 2015.
Carla D. Savage and Gopal Viswanathan, The 1/k-Eulerian polynomials, Elec. J. of Comb., Vol. 19, Issue 1, #P9 (2012).
Eric Weisstein's World of Mathematics, Dirichlet Eta Function

A142963 and this sequence can be mapped onto the A156920 triangle.
FP1 sequences A000340, A156922, A156923, A156924.
FP2 sequences A050488, A142965, A142966, A142968.
Appears in A162005, A000182, A162006 and A162007.
Cf. A186695, A187075.
Cf. A185410 (row reverse), A185411.

A156919 := proc(n,m) if n=m then 1; elif m=0 then 2^n ; elif m<0 or m>n then 0; else 2*(m+1)*procname(n-1,m)+(2*n-2*m+1)*procname(n-1,m-1) ; end if; end proc: seq(seq(A156919(n,m), m=0..n), n=0..7); # R. J. Mathar, Feb 03 2011

g[0] = 1/Sqrt[1-x]; g[n_] := g[n] = 2x*D[g[n-1], x]; p[n_] := g[n] / g[0]^(2n+1) // Cancel; row[n_] := CoefficientList[p[n], x] // Rest; Table[row[n], {n, 0, 9}] // Flatten (* Jean-François Alcover, Aug 09 2012, after Peter Bala *)
Flatten[Table[Rest[CoefficientList[Nest[2 x D[#, x] &, (1 - x)^(-1/2), k] (1 - x)^(k + 1/2), x]], {k, 10}]] (* Jan Mangaldan, Mar 15 2013 *)

SF(z; n) = Sum_{m >= 1} m^(n-1)*4^(-m)*z^(m-1)*Gamma(2*m+1)/(Gamma(m)^2) = P(z;n) / (2^(n+1)*(1-z)^((2*n+3)/2)) for n >= 0. The polynomials P(z;n) = Sum_{k = 0..n} a(k)*z^k generate the a(n) sequence.
If we write the sequence as a triangle the following relation holds: T(n,m) = (2*m+2)*T(n-1,m) + (2*n-2*m+1)*T(n-1,m-1) with T(n,m=0) = 2^n and T(n,n) = 1, n >= 0 and 0 <= m <= n.
G.f.: 1/(1-xy-2x/(1-3xy/(1-4x/(1-5xy/(1-6x/(1-7xy/(1-8x/(1-... (continued fraction). - Paul Barry, Jan 26 2011
From Peter Bala, Apr 03 2011 (Start)
E.g.f.: exp(z*(x + 2)) * (1 - x)/(exp(2*x*z) - x*exp(2*z))^(3/2) = Sum_{n >= 0} P(x,n)*z^n/n! = 1 + (2 + x)*z + (4 + 10*x + x^2)*z^2/2! + (8 + 60*x + 36*x^2 + x^3)*z^3/3! + ... .
Explicit formula for the row polynomials:
P(x,n-1) = Sum_{k = 1..n} 2^(n-2*k)*binomial(2k,k)*k!*Stirling2(n,k)*x^(k-1)*(1 - x)^(n-k).
The polynomials x*(1 + x)^n * P(x/(x + 1),n) are the row polynomials of A187075.
The polynomials x^(n+1) * P((x + 1)/x,n) are the row polynomials of A186695.
Row sums are A001147(n+1). (End)
Sum_{k = 0..n} (-1)^k*T(n,k) = (-1)^binomial(n,2)*A012259(n+1). - Johannes W. Meijer, Sep 27 2011

Minor edits from Johannes W. Meijer, Sep 27 2011

A156922 Third right hand column (n-m=2) of the A156920 triangle.

Original entry on oeis.org

1, 15, 129, 877, 5280, 29658, 159742, 838038, 4323003, 22057825, 111750519, 563535483, 2833221970, 14216330916, 71243079660, 356731958812, 1785306330981, 8931761831331, 44675371382365

Offset: 0

Johannes W. Meijer, Feb 20 2009

Other columns A000340, A156923, A156924.
Equals A156920 third right hand column.
Equals A156919 third right hand column divided by 4.
Equals A142963 third right hand column divided by 2^n.

a(n) = 14*a(n-1)-75*a(n-2)+196*a(n-3)-263*a(n-4)+174*a(n-5)-45*a(n-6)
a(n) = (4*n^2-108*n*3^n+24*n-378*3^n+375*5^n+35)/32
G.f.: GF1(z;RHCnr=3) = (1+z-6*z^2)/((1-5*z)*(1-3*z)^2*(1-z)^3)

A156923 Fourth right hand column (n-m=3) of the A156920 triangle.

Original entry on oeis.org

1, 37, 646, 8030, 82610, 756218, 6411720, 51586344, 400011435, 3020658295, 22373863774, 163379472214, 1180488191108, 8462445970580, 60305767988960, 427848087263712, 3025286818472661

Offset: 0

Johannes W. Meijer, Feb 20 2009

Other columns A000340, A156922, A156924.
Equals A156920 fourth right hand column.
Equals A156919 fourth right hand column divided by 8.
Equals A142963 fourth right hand column divided by 2^n

a(n) = 30*a(n-1)-385*a(n-2)+2776*a(n-3)-12418*a(n-4)+35908*a(n-5)-67818*a(n-6)+82552*a(n-7)-62109*a(n-8)+26190*a(n-9)-4725*a(n-10)
a(n) = (-8*n^3+972*n^2*3^n-84*n^2+7776*n*3^n-11250*n*5^n-286*n+15309*3^n-50625*5^n+36015*7^n-315)/384
G.f.: GF1(z;RHCnr=4) = (1+7*z-79*z^2+119*z^3+126*z^4-270*z^5)/((1-7*z)*(1-5*z)^2*(1-3*z)^3*(1-z)^4)

cp's OEIS Frontend

A156920 Triangle of the normalized A142963 and A156919 sequences.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A142965 One fourth of third column (m=2) of triangle A142963.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A142966 Fourth column (m=3) of triangle A142963 divided by 8.

Views

Author

Keywords

Crossrefs

Formula

A142968 Fifth column (m=4) of triangle A142963 divided by 16=2^4.

Views

Author

Keywords

Crossrefs

Formula

A142967 Row sums of triangle A142963.

Views

Author

Keywords

Crossrefs

Formula

A000340 a(0)=1, a(n) = 3*a(n-1) + n + 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Formula

A050488 a(n) = 3*(2^n-1) - 2*n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Python

Formula

A156919 Table of coefficients of polynomials related to the Dirichlet eta function.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A050488 a(n) = 3(2^n-1) - 2n.