A129955 -id:A129955 - cp's OEIS frontend

A129952 Binomial transform of A124625.

1, 1, 2, 6, 16, 40, 96, 224, 512, 1152, 2560, 5632, 12288, 26624, 57344, 122880, 262144, 557056, 1179648, 2490368, 5242880, 11010048, 23068672, 48234496, 100663296, 209715200, 436207616, 905969664, 1879048192, 3892314112

Offset: 0

Paul Curtz, Jun 10 2007

Essentially the same as A057711: a(n) = A057711(n) for n >= 1.

Number of permutations of length n>=0 avoiding the partially ordered pattern (POP) {1>2, 1>3} of length 4. That is, number of length n permutations having no subsequences of length 4 in which the first element is larger than the second and third elements. - Sergey Kitaev, Dec 08 2020

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Alice L. L. Gao and Sergey Kitaev, On partially ordered patterns of length 4 and 5 in permutations, arXiv:1903.08946 [math.CO], 2019.
Alice L. L. Gao and Sergey Kitaev, On partially ordered patterns of length 4 and 5 in permutations, The Electronic Journal of Combinatorics 26(3) (2019), P3.26.
Index entries for linear recurrences with constant coefficients, signature (4,-4).

Cf. A124625, A045623, A057711, A129953 (first differences), A129954 (second differences), A129955 (third differences).

m:=15; S:=&cat[ [ 1, 2*i ]: i in [0..m] ]; [ &+[ Binomial(j-1, k-1)*S[k]: k in [1..j] ]: j in [1..2*m] ]; // Klaus Brockhaus, Jun 17 2007

LinearRecurrence[{4, -4}, {1, 1, 2, 6}, 30] (* G. C. Greubel, Jun 08 2016; corrected by Georg Fischer, Apr 02 2019 *)

{m=29; print1(1, ",", 1, ","); for(n=2, m, print1(n*2^(n-2), ","))} \\ Klaus Brockhaus, Jun 17 2007

def A129952(n): return n<1 else 1 # Chai Wah Wu, Oct 03 2024

a(0) = 1, a(1) = 1; for n > 1, a(n) = n*2^(n-2).
G.f.: (1-3*x+2*x^2+2*x^3)/(1-2*x)^2.
E.g.f.: (1/2)*(x*exp(2*x) + x + 2). - G. C. Greubel, Jun 08 2016

Edited and extended by Klaus Brockhaus, Jun 17 2007

A227978 a(0)=1, a(1)=2; for n>1, a(n) = n*(2^n+4)/4.

Original entry on oeis.org

1, 2, 4, 9, 20, 45, 102, 231, 520, 1161, 2570, 5643, 12300, 26637, 57358, 122895, 262160, 557073, 1179666, 2490387, 5242900, 11010069, 23068694, 48234519, 100663320, 209715225, 436207642, 905969691, 1879048220, 3892314141, 8053063710, 16642998303

Offset: 0

Paul Curtz, Oct 07 2013

The inverse binomial transform of A176328/A176591 (see Comments field in A228827) begins: 1, -2, 25/6, -9, 599/30, -45, 4285/42, -231, 15599/30, -1161, 169625/66, ... Consider these values without sign and the fractions rounded to the nearest integer, the sequence lists the resulting numbers.
Differences table of a(n):
  1, 2,  4,  9, 20,  45, 102, 231,  520, 1161, ...
  1, 2,  5, 11, 25,  57, 129, 289,  641, 1409, ... After 2: 2^m*(m+4)+1.
  1, 3,  6, 14, 32,  72, 160, 352,  768, 1664, ... A078836 (after 3).
  2, 3,  8, 18, 40,  88, 192, 416,  896, 1920, ... A129955.
  1, 5, 10, 22, 48, 104, 224, 480, 1024, 2176, ... A079861 (after 5).
  4, 5, 12, 26, 56, 120, 256, 544, 1152, 2432, ... After 5: 2^m*(m+12).
  1, 7, 14, 30, 64, 136, 288, 608, 1280, 2688, ... After 7: 2^m*(m+14).
  6, 7, 16, 34, 72, 152, 320, 672, 1408, 2944, ..., etc.
(n-1)*a(n)-n*a(n-1) = A001788(n-1) for n>1. [Bruno Berselli, Oct 11 2013]

Bruno Berselli, Table of n, a(n) for n = 0..200
Index entries for linear recurrences with constant coefficients, signature (6,-13,12,-4).

Cf. A001788, A079862, A079863.

[1,2] cat [n*(2^n+4)/4: n in [2..40]]; // Bruno Berselli, Oct 11 2013

Join[{1, 2}, Table[n (2^n + 4)/4, {n, 2, 40}]] (* Bruno Berselli, Oct 11 2013 *)

a(n) = if (n == 0, 1, if (n == 1, 2, n*(2^n+4)/4)); \\ Michel Marcus, Oct 11 2013

a(2n+2) = A229135(n+1); a(2n-1) = -A228767(n) for n>0.
a(n) = 6*a(n-1) -13*a(n-2) +12*a(n-3) -4*a(n-4) for n>5.
G.f.: (1-4*x+5*x^2-x^3-2*x^4+2*x^5)/((1-x)^2*(1-2*x)^2). - Colin Barker, Oct 09 2013

More terms from Colin Barker, Oct 09 2013

A130002 Alternating sum along antidiagonals of the array of A129952 and its iterated differences.

Original entry on oeis.org

1, 1, 2, 3, 10, 23, 60, 139, 326, 735, 1648, 3635, 7962, 17287, 37316, 80091, 171118, 364079, 771864, 1631107, 3436994, 7223511, 15146092, 31690283, 66176790, 137945983, 287076800, 596523219, 1237785706, 2565049895, 5309056788, 10976027515, 22667882942

Offset: 0

Paul Curtz, Jun 15 2007

nonn

Define the square array T of A129952 and its iterated differences: T(0,n)=A129952(n), T(d,n)=T(d-1,n+1)-T(d-1,n), d>0. Then a(n) = sum_{d=0..n} (-1)^d*T(d,n-d), the sum along the antidiagonals of T(d,n), alternating signs.

			The original series and first, 2nd etc. differences are the rows of
1..1..2...6..16..40.. <- A129952 = T(0,n)
0..1..4..10..24..56.. <- A129953 = T(1,n)
1..3..6..14..32..72.. <- A129954 = T(2,n)
2..3..8..18..40..88.. <- A129955 = T(3,n)
1..5.10..22..48......
...
a(2) = 2-1+1 = 2. a(3) = 6-4+3-2 = 3. a(4) = 16-10+6-3+1 = 10.

From Chai Wah Wu, Jan 30 2018: (Start)
a(n) = 4*a(n-1) - 2*a(n-2) - 8*a(n-3) + 7*a(n-4) + 4*a(n-5) - 4*a(n-6) for n > 6.
G.f.: (-2*x^6 - 6*x^5 + 3*x^4 + 5*x^3 - 3*x + 1)/((x - 1)^2*(x + 1)^2*(2*x - 1)^2). (End)

Edited and extended by R. J. Mathar, Jun 30 2008

cp's OEIS Frontend

A129952 Binomial transform of A124625.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Formula

Extensions

A227978 a(0)=1, a(1)=2; for n>1, a(n) = n*(2^n+4)/4.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A130002 Alternating sum along antidiagonals of the array of A129952 and its iterated differences.

Views

Author

Keywords

Comments

Examples

Formula

Extensions