login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A011801 Triangle read by rows, the inverse Bell transform of n!*binomial(4,n) (without column 0). 12
1, 4, 1, 36, 12, 1, 504, 192, 24, 1, 9576, 3960, 600, 40, 1, 229824, 100656, 17160, 1440, 60, 1, 6664896, 3048192, 563976, 54600, 2940, 84, 1, 226606464, 107255232, 21095424, 2256576, 142800, 5376, 112, 1, 8837652096, 4302305280, 887785920 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Previous name was: Triangle of numbers related to triangle A049223; generalization of Stirling numbers of second kind A008277, Bessel triangle A001497.

a(n,m) := S2p(-4; n,m), a member of a sequence of triangles including S2p(-1; n,m) := A001497(n-1,m-1) (Bessel triangle) and ((-1)^(n-m))*S2p(1; n,m) := A008277(n,m) (Stirling 2nd kind). a(n,1) = A008546(n-1).

For the definition of the Bell transform see A264428 and the link. - Peter Luschny, Jan 16 2016

LINKS

Table of n, a(n) for n=1..39.

P. Blasiak, K. A. Penson and A. I. Solomon, The general boson normal ordering problem, arXiv:quant-ph/0402027, 2004.

W. Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.

Peter Luschny, The Bell transform

Index entries for sequences related to Bessel functions or polynomials

FORMULA

a(n, m) = n!*A049223(n, m)/(m!*5^(n-m));

a(n+1, m) = (5*n-m)*a(n, m) + a(n, m-1), n >= m >= 1;

a(n, m) := 0, n<m; a(n, 0) := 0, a(1, 1)=1;

E.g.f. of m-th column: ((1-(1-5*x)^(1/5))^m)/m!.

EXAMPLE

Triangle starts:

{   1}

{   4,    1}

{  36,   12,   1}

{ 504,  192,  24,  1}

{9576, 3960, 600, 40, 1}

MATHEMATICA

a[n_, m_] /; n >= m >= 1 := a[n, m] = (5*(n-1)-m)*a[n-1, m] + a[n-1, m-1]; a[n_, m_] /; n<m = 0; a[_, 0] = 0; a[1, 1] = 1;

Table[a[n, m], {n, 1, 10}, {m, 1, n}] // Flatten (* Jean-François Alcover, Jun 20 2018 *)

rows = 10;

b[n_, m_] := BellY[n, m, Table[k! Binomial[4, k], {k, 0, rows}]];

A = Table[b[n, m], {n, 1, rows}, {m, 1, rows}] // Inverse // Abs;

A011801 = Table[A[[n, m]], {n, 1, rows}, {m, 1, n}] // Flatten (* Jean-François Alcover, Jun 22 2018 *)

PROG

(Sage)

# The function inverse_bell_matrix is defined in A264428.

# Adds 1, 0, 0, 0, ... as column 0 at the left side of the triangle.

inverse_bell_matrix(lambda n: factorial(n)*binomial(4, n), 8) # Peter Luschny, Jan 16 2016

CROSSREFS

Cf. A001497, A008277, A049223.

Cf. A000369, A004747, A028575.

Sequence in context: A061036 A217020 A144267 * A169656 A303987 A297900

Adjacent sequences:  A011798 A011799 A011800 * A011802 A011803 A011804

KEYWORD

easy,nonn,tabl

AUTHOR

Wolfdieter Lang

EXTENSIONS

New name from Peter Luschny, Jan 16 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 22:51 EST 2019. Contains 319251 sequences. (Running on oeis4.)