251680
domain: N
Appears in sequences
- q-factorial numbers for q=3.at n=5A015001
- Array of q-factorial numbers n!_q, read by ascending antidiagonals.at n=39A069777
- Number of palindromes that use nonzero digits and have a digit sum of n.at n=35A082267
- Number of palindromes that use nonzero digits and have a digit sum of n.at n=36A082267
- A q-factorial type triangle sequence: t(n,m)=Product[Sum[(m + 1)^i, {i, 0, k - 1}], {k, 1, n}].at n=11A156173
- Array A(n, k) = Product_{j=1..n} ( (k+1)^j - 1 ) with A(n, 0) = n!, read by antidiagonals.at n=33A156540
- 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 = 2, read by rows.at n=16A156951
- 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 = 2, read by rows.at n=19A156951
- q-factorial numbers 5!_q.at n=3A218503
- 9-step Fibonacci sequence starting with 0,0,0,0,1,0,0,0,0.at n=27A251749
- 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 = 3.at n=17A347486