A265606 Triangle read by rows: The Bell transform of the quartic factorial numbers (A007696).
1, 0, 1, 0, 1, 1, 0, 5, 3, 1, 0, 45, 23, 6, 1, 0, 585, 275, 65, 10, 1, 0, 9945, 4435, 990, 145, 15, 1, 0, 208845, 89775, 19285, 2730, 280, 21, 1, 0, 5221125, 2183895, 456190, 62965, 6370, 490, 28, 1, 0, 151412625, 62002395, 12676265, 1715490, 171255, 13230, 798, 36, 1
Offset: 0
Examples
[1], [0, 1], [0, 1, 1], [0, 5, 3, 1], [0, 45, 23, 6, 1], [0, 585, 275, 65, 10, 1], [0, 9945, 4435, 990, 145, 15, 1], [0, 208845, 89775, 19285, 2730, 280, 21, 1],
Links
- Richell O. Celeste, Roberto B. Corcino, and Ken Joffaniel M. Gonzales. Two Approaches to Normal Order Coefficients, Journal of Integer Sequences, Vol. 20 (2017), Article 17.3.5.
- Peter Luschny, The Bell transform
Crossrefs
Programs
-
Mathematica
(* The function BellMatrix is defined in A264428. *) rows = 10; M = BellMatrix[Pochhammer[1/4, #] 4^# &, rows]; Table[M[[n, k]], {n, 1, rows}, {k, 1, n}] // Flatten (* Jean-François Alcover, Jul 23 2019 *)
-
Sage
# uses[bell_transform from A264428] def A265606_row(n): multifact_4_1 = lambda n: prod(4*k + 1 for k in (0..n-1)) mfact = [multifact_4_1(k) for k in (0..n)] return bell_transform(n, mfact) [A265606_row(n) for n in (0..7)]