[go: up one dir, main page]

login
Revision History for A257625 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Triangle read by rows: T(n, k) = t(n-k, k), where 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), and f(n) = 6*n + 3.
(history; published version)
#13 by Joerg Arndt at Tue Mar 01 05:32:42 EST 2022
STATUS

reviewed

approved

#12 by Michel Marcus at Tue Mar 01 03:24:13 EST 2022
STATUS

proposed

reviewed

#11 by G. C. Greubel at Tue Mar 01 03:03:35 EST 2022
STATUS

editing

proposed

#10 by G. C. Greubel at Tue Mar 01 03:03:30 EST 2022
NAME

Triangle read by rows: T(n, k) = t(n-k, k); , where 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 and f(xn) = 6*x n + 3.

COMMENTS

Row sums are: 1, 6, 72, 1296, 31104, 933120, 33592320, 1410877440, 67722117120, 3656994324480, ... (see A047058).

LINKS

G. C. Greubel, <a href="/A257625/b257625.txt">Rows n = 0..50 of the triangle, flattened</a>

FORMULA

T(n, k) = t(n-k, k); , where 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 and f(xn) = 6*x n + 3.

Sum_{k=0..n} T(n, k) = A047058(n).

From G. C. Greubel, Mar 01 2022: (Start)

t(k, n) = t(n, k).

T(n, n-k) = T(n, k).

t(0, n) = T(n, 0) = A000244(n). (End)

EXAMPLE

Array t(n,k) begins as:

1, 3, 9, 27, 81, ...;

3, 54, 621, 6156, 57591, ...;

9, 621, 18630, 408726, 7685847, ...;

27, 6156, 408726, 17166492, 568014201, ...;

81, 57591, 7685847, 568014201, 30672766854, ...;

243, 526338, 132656859, 16305974568, 1366261865802, ...;

729, 4765473, 2175706332, 427278012876, 53552912878818, ...;

Triangle T(n,k) begins as:

1;

3 , 3;

9 , 54 , 9;

27 , 621 , 621 , 27;

81 , 6156 , 18630 , 6156 , 81;

243 , 57591 , 408726 , 408726 , 57591 , 243;

729 , 526338 , 7685847 , 17166492 , 7685847 , 526338 , 729;

2187 , 4765473 , 132656859 , 568014201 , 568014201 , 132656859 , 4765473 , 2187;

MATHEMATICA

t[n_, k_, p_, q_]:= t[n, k, p, q] = If[n<0 || k<0, 0, If[n==0 && k==0, 1, (p*k+q)*t[n-1, k, p, q] + (p*n+q)*t[n, k-1, p, q]]];

T[n_, k_, p_, q_]= t[n-k, k, p, q];

Table[T[n, k, 6, 3], {n, 0, 12}, {k, 0, n}]//Flatten (* G. C. Greubel, Mar 01 2022 *)

PROG

(Sage)

@CachedFunction

def t(n, k, p, q):

if (n<0 or k<0): return 0

elif (n==0 and k==0): return 1

else: return (p*k+q)*t(n-1, k, p, q) + (p*n+q)*t(n, k-1, p, q)

def A257625(n, k): return t(n-k, k, 6, 3)

flatten([[A257625(n, k) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, Mar 01 2022

CROSSREFS

Cf. A047058 (row sums), A142461, A257616.

STATUS

approved

editing

#9 by R. J. Mathar at Wed Nov 04 11:11:57 EST 2015
STATUS

editing

approved

#8 by R. J. Mathar at Wed Nov 04 11:11:52 EST 2015
CROSSREFS
STATUS

approved

editing

#7 by Bruno Berselli at Tue May 19 05:49:56 EDT 2015
STATUS

proposed

approved

#6 by Dale Gerdemann at Tue May 19 05:49:24 EDT 2015
STATUS

editing

proposed

#5 by Dale Gerdemann at Tue May 19 05:48:53 EDT 2015
STATUS

approved

editing

Discussion
Tue May 19
05:49
Dale Gerdemann: Eliminated nonvalid xrefs
#4 by N. J. A. Sloane at Sun May 10 13:54:07 EDT 2015
STATUS

proposed

approved