A147630 -id:A147630 - cp's OEIS frontend

A256890 Triangle T(n,k) = t(n-k, k); t(n,m) = f(m)t(n-1,m) + f(n)t(n,m-1), where f(x) = x + 2.

1, 2, 2, 4, 12, 4, 8, 52, 52, 8, 16, 196, 416, 196, 16, 32, 684, 2644, 2644, 684, 32, 64, 2276, 14680, 26440, 14680, 2276, 64, 128, 7340, 74652, 220280, 220280, 74652, 7340, 128, 256, 23172, 357328, 1623964, 2643360, 1623964, 357328, 23172, 256, 512, 72076, 1637860, 10978444, 27227908, 27227908, 10978444, 1637860, 72076, 512

Offset: 0

Dale Gerdemann, Apr 12 2015

Related triangles may be found by varying the function f(x). If f(x) is a linear function, it can be parameterized as f(x) = a*x + b. With different values for a and b, the following triangles are obtained:
  a\b 1.......2.......3.......4.......5.......6
  -1  A144431
  0   A007318 A038208 A038221
  1   A008292 A256890 A257180 A257606 A257607
  2   A060187 A257609 A257611 A257613 A257615
  3   A142458 A257610 A257620 A257622 A257624 A257626
  4   A142459 A257612 A257621
  5   A142460 A257614 A257623
  6   A142461 A257616 A257625
  7   A142462 A257617 A257627
  8   A167884 A257618
  9   A257608 A257619
The row sums of these, and similarly constructed number triangles, are shown in the following table:
  a\b 1.......2.......3.......4.......5.......6.......7.......8.......9
  0   A000079 A000302 A000400
  1   A000142 A001715 A001725 A049388 A049198
  2   A000165 A002866 A002866 A051580 A051582
  3   A008544 A051578 A037559 A051605 A051607 A051609
  4   A001813 A047053 A000407 A034177 A051618 A051620 A051622
  5   A047055 A008546 A008548 A034300 A034325 A051688 A051690
  6   A047657 A049308 A047058 A034689 A034724 A034788 A053101 A053103
  7   A084947 A144827 A049209 A045754 A034830 A034832 A034834 A053105
  8   A084948 A144828 A147626 A051189 A034908 A034910 A034912 A034976 A053115
  9   A084949 A144829 A147630 A049211 A045756 A035013 A035018 A035021 A035023
  10                                  A051262 A035265 A035273         A035277
  11                                  A254322
  12                                          A145448
The formula can be further generalized to: t(n,m) = f(m+s)*t(n-1,m) + f(n-s)*t(n,m-1), where f(x) = a*x + b. The following table specifies triangles with nonzero values for s (given after the slash).
  a\b  0           1           2          3
  -2   A130595/1
  -1
  0
  1    A110555/-1  A120434/-1  A144697/1  A144699/2
With the absolute value, f(x) = |x|, one obtains A038221/3, A038234/4, A038247/5, A038260/6, A038273/7, A038286/8, A038299/9 (with value for s after the slash).
If f(x) = A000045(x) (Fibonacci) and s = 1, the result is A010048 (Fibonomial).
In the notation of Carlitz and Scoville, this is the triangle of generalized Eulerian numbers A(r, s | alpha, beta) with alpha = beta = 2. Also the array A(2,1,4) in the notation of Hwang et al. (see page 31). - Peter Bala, Dec 27 2019

			Array, t(n, k), begins as:
   1,    2,      4,        8,        16,         32,          64, ...;
   2,   12,     52,      196,       684,       2276,        7340, ...;
   4,   52,    416,     2644,     14680,      74652,      357328, ...;
   8,  196,   2644,    26440,    220280,    1623964,    10978444, ...;
  16,  684,  14680,   220280,   2643360,   27227908,   251195000, ...;
  32, 2276,  74652,  1623964,  27227908,  381190712,  4677894984, ...;
  64, 7340, 357328, 10978444, 251195000, 4677894984, 74846319744, ...;
Triangle, T(n, k), begins as:
    1;
    2,     2;
    4,    12,      4;
    8,    52,     52,       8;
   16,   196,    416,     196,      16;
   32,   684,   2644,    2644,     684,      32;
   64,  2276,  14680,   26440,   14680,    2276,     64;
  128,  7340,  74652,  220280,  220280,   74652,   7340,   128;
  256, 23172, 357328, 1623964, 2643360, 1623964, 357328, 23172,   256;

Michael De Vlieger, Table of n, a(n) for n = 0..11475 (rows 0 <= n <= 150, flattened.)
L. Carlitz and R. Scoville, Generalized Eulerian numbers: combinatorial applications, J. für die reine und angewandte Mathematik, 265 (1974): 110-37. See Section 3.
Dale Gerdemann, A256890, Plot of t(m,n) mod k , YouTube, 2015.
Hsien-Kuei Hwang, Hua-Huai Chern, and Guan-Huei Duh, An asymptotic distribution theory for Eulerian recurrences with applications, arXiv:1807.01412 [math.CO], 2018-2019.

Cf. A000079, A001715, A008292, A038208, A257180, A257606, A257607, A257609.

Cf. A257610, A257612, A257614, A257616, A257617, A257618, A257619.

A256890:= func< n,k | (&+[(-1)^(k-j)*Binomial(j+3,j)*Binomial(n+4,k-j)*(j+2)^n: j in [0..k]]) >;
[A256890(n,k): k in [0..n], n in [0..10]]; // G. C. Greubel, Oct 18 2022

Table[Sum[(-1)^(k-j)*Binomial[j+3, j] Binomial[n+4, k-j] (j+2)^n, {j,0,k}], {n,0, 9}, {k,0,n}]//Flatten (* Michael De Vlieger, Dec 27 2019 *)

t(n,m) = if ((n<0) || (m<0), 0, if ((n==0) && (m==0), 1, (m+2)*t(n-1, m) + (n+2)*t(n, m-1)));
tabl(nn) = {for (n=0, nn, for (k=0, n, print1(t(n-k, k), ", ");); print(););} \\ Michel Marcus, Apr 14 2015

def A256890(n,k): return sum((-1)^(k-j)*Binomial(j+3,j)*Binomial(n+4,k-j)*(j+2)^n for j in range(k+1))
flatten([[A256890(n,k) for k in range(n+1)] for n in range(11)]) # G. C. Greubel, Oct 18 2022

T(n,k) = t(n-k, k); t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0 else t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = x + 2.
Sum_{k=0..n} T(n, k) = A001715(n).
T(n,k) = Sum_{j = 0..k} (-1)^(k-j)*binomial(j+3,j)*binomial(n+4,k-j)*(j+2)^n. - Peter Bala, Dec 27 2019
Modified rule of Pascal: T(0,0) = 1, T(n,k) = 0 if k < 0 or k > n else T(n,k) = f(n-k) * T(n-1,k-1) + f(k) * T(n-1,k), where f(x) = x + 2. - Georg Fischer, Nov 11 2021
From G. C. Greubel, Oct 18 2022: (Start)
T(n, n-k) = T(n, k).
T(n, 0) = A000079(n). (End)

A035020 One sixth of 9-factorial numbers.

Original entry on oeis.org

1, 15, 360, 11880, 498960, 25446960, 1526817600, 105350414400, 8217332323200, 714907912118400, 68631159563366400, 7206271754153472000, 821514979973495808000, 101046342536739984384000, 13338117214849677938688000, 1880674527293804589355008000, 282101179094070688403251200000

Offset: 1

Wolfdieter Lang

G. C. Greubel, Table of n, a(n) for n = 1..325
Index entries for sequences related to factorial numbers.

Cf. A007559, A034000, A034171, A035012, A035013, A035017, A147630.

Cf. A035018, A035020, A035021, A035022, A035023, A045756.

[n le 1 select 1 else (9*n-3)*Self(n-1): n in [1..40]]; // G. C. Greubel, Oct 18 2022

s=1;lst={s};Do[s+=n*s;AppendTo[lst, s], {n, 14, 2*5!, 9}];lst (* Vladimir Joseph Stephan Orlovsky, Nov 08 2008 *)
Table[9^n*Pochhammer[2/3, n]/6, {n, 40}] (* G. C. Greubel, Oct 18 2022 *)

[9^n*rising_factorial(2/3,n)/6 for n in range(1,40)] # G. C. Greubel, Oct 18 2022

6*a(n) = (9*n-3)(!^9) := Product_{j=1..n} (9*j-3) = 3^n*2*A034000(n), where 2*A034000(n) = (3*n-1)(!^3) := Product_{j=1..n} (3*j-1).
E.g.f.: (-1+(1-9*x)^(-2/3))/6.
From G. C. Greubel, Oct 18 2022: (Start)
a(n) = (1/6) * 9^n * Pochhammer(n, 2/3).
a(n) = (9*n - 3)*a(n-1). (End)
From Amiram Eldar, Dec 21 2022: (Start)
a(n) = A147630(n+1)/6.
Sum_{n>=1} 1/a(n) = 6*(e/9^3)^(1/9)*(Gamma(2/3) - Gamma(2/3, 1/9)). (End)

A268730 a(n) = Product_{k = 0..n} 2(8k + 5).

Original entry on oeis.org

10, 260, 10920, 633360, 46868640, 4218177600, 447126825600, 54549472723200, 7527827235801600, 1159285394313446400, 197078517033285888000, 36656604168191175168000, 7404634041974617383936000, 1614210221150466589698048000, 377725191749209181989343232000

Offset: 0

Ilya Gutkovskiy, Feb 12 2016

			a(0) = (1 + 2 + 3 + 4) = 10;
a(1) = (1 + 2 + 3 + 4)*(5 + 6 + 7 + 8) = 260;
a(2) = (1 + 2 + 3 + 4)*(5 + 6 + 7 + 8) *(9 + 10 + 11 + 12) = 10920;
a(3) = (1 + 2 + 3 + 4)*(5 + 6 + 7 + 8) *(9 + 10 + 11 + 12)*(13 + 14 + 15 + 16) = 633360, etc.

G. C. Greubel, Table of n, a(n) for n = 0..300

Cf. A000027, A113770, A147630.

[&*[(16*k+10): k in [0..n-1]]: n in [1..20]]; // Vincenzo Librandi, Feb 12 2016

FullSimplify[Table[(2^(4 n + 13/4) Gamma[1/8] Gamma[n + 13/8])/(Sqrt[Pi] Gamma[1/4]), {n, 0, 14}]]
Table[Product[16 k + 10, {k, 0, n - 1}], {n, 20}] (* Vincenzo Librandi, Feb 12 2016 *)

x='x+O('x^50); Vec(serlaplace(10/(1 - 16*x)^(13/8))) \\ G. C. Greubel, Apr 09 2017

a(n) = (2^(4*n + 13/4)*Gamma(1/8)*Gamma(n + 13/8))/(sqrt(Pi)*Gamma(1/4)), where Gamma(x) is the gamma function.
a(n) = 2*(8*n + 5)*a(n - 1), a(0)=10.
Sum_{n>=0} 1/a(n) = (exp(1/16)*(Gamma(5/8) - Gamma(5/8, 1/16)))/(2*sqrt(2)) = 0.10393932939417..., where Gamma(a, x) is the incomplete gamma function.
a(n) ~ sqrt(Pi) * 2^(4*n+9/2) * n^(n+9/8) / (Gamma(5/8) * exp(n)). - Vaclav Kotesovec, Feb 20 2016
G.f.: 10/(1-b(1)x/(1-(b(1)-10)x/(1-b(2)x/(1-(b(2)-10)x/(1-b(3)x/(...)))))), where b(n)=2(5+8n), i.e. 26,42,58,74. - Benedict W. J. Irwin, Feb 24 2016
a(n) = 2^(n+1)*A147625(n+2). - R. J. Mathar, Jun 07 2016
E.g.f.: 10/(1 - 16*x)^(13/8). - Ilya Gutkovskiy, Jun 07 2016

A147631 9-factorial numbers (6).

Original entry on oeis.org

1, 7, 112, 2800, 95200, 4093600, 212867200, 12984899200, 908942944000, 71806492576000, 6318971346688000, 612940220628736000, 64971663386646016000, 7471741289464291840000, 926495919893572188160000, 123223957345845101025280000, 17497801943110004345589760000

Offset: 1

Vladimir Joseph Stephan Orlovsky, Nov 08 2008

nonn

Cf. A147630, A147629, A049211, A051232, A045756, A035012, A035013, A035017, A035018, A035020, A035022, A035023, A053116.

Cf. A048994, A132393.

s=1;lst={s};Do[s+=n*s;AppendTo[lst,s],{n,6,2*5!,9}];lst

a(n+1) = Sum_{k=0..n} A132393(n,k)*7^k*9^(n-k). - Philippe Deléham, Nov 09 2008
a(n) = (-2)^n*Sum_{k=0..n} (9/2)^k*s(n+1,n+1-k), where s(n,k) are the Stirling numbers of the first kind, A048994. - Mircea Merca, May 03 2012
Sum_{n>=1} 1/a(n) = 1 + (e/9^2)^(1/9)*(Gamma(7/9) - Gamma(7/9, 1/9)). - Amiram Eldar, Dec 21 2022

cp's OEIS Frontend

A256890 Triangle T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = x + 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula

A035020 One sixth of 9-factorial numbers.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A268730 a(n) = Product_{k = 0..n} 2*(8*k + 5).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A147631 9-factorial numbers (6).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula

A256890 Triangle T(n,k) = t(n-k, k); t(n,m) = f(m)t(n-1,m) + f(n)t(n,m-1), where f(x) = x + 2.

A268730 a(n) = Product_{k = 0..n} 2(8k + 5).