3043425

Appears in sequences

• q-factorial numbers for q=4.at n=5A015002
• For a rational number p/q let f(p/q) = p*q divided by the sum of digits of p and q; a(n) is obtained by iterating f, starting at n/1, until an integer is reached, or if no integer is ever reached then a(n) = 0.at n=28A059175
• Array of q-factorial numbers n!_q, read by ascending antidiagonals.at n=49A069777
• A q-factorial type triangle sequence: t(n,m)=Product[Sum[(m + 1)^i, {i, 0, k - 1}], {k, 1, n}].at n=12A156173
• Array A(n, k) = Product_{j=1..n} ( (k+1)^j - 1 ) with A(n, 0) = n!, read by antidiagonals.at n=41A156540
• Triangle T(n, k, q) = t(n,q)/(t(k,q)*t(n-k,q)), where t(n, k) = Product_{j=1..n} q-Pochhammer(j, k+1, k+1)/(1-(k+1))^j and t(n, 0) = n!, with q = 3, read by rows.at n=16A156952
• Triangle T(n, k, q) = t(n,q)/(t(k,q)*t(n-k,q)), where t(n, k) = Product_{j=1..n} q-Pochhammer(j, k+1, k+1)/(1-(k+1))^j and t(n, 0) = n!, with q = 3, read by rows.at n=19A156952
• q-factorial numbers 5!_q.at n=4A218503
• Irregular triangle read by rows: T(n, k) is the q-multinomial coefficient defined by the k-th partition of n in Abramowitz-Stegun order, evaluated at q = 4.at n=17A347487