58576
domain: N
Appears in sequences
- Expansion of 1/((1-4*x)*(1-6*x)*(1-12*x)).at n=4A019490
- Number of partitions of n into parts not of the form 23k, 23k+7 or 23k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=44A035995
- Exponential generating function is exp(2*x/(1-x))/(1-x).at n=6A087912
- Matrix square of triangle A104980.at n=29A104988
- Triangle read by rows, based on a simple Jacobsthal number recursion rule.at n=48A114163
- Square array, read by antidiagonals, where row n+1 is generated from row n by first removing terms in row n at positions 0 and {(m+1)*(m+2)/2-2, m>0} and then taking partial sums, starting with all 1's in row 0.at n=48A156628
- Smallest k such that A002522(k) and A002522(k+2n) are successive primes of the form m^2+1.at n=39A245463
- A(n,k) = n! * Laguerre(n,-k); square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=42A289192
- T(n, k) = (n - k)! * [x^(n-k)] exp(k*x/(1 - x))/(1 - x). Triangle read by rows, T(n, k) for 0 <= k <= n.at n=38A343847
- T(n, k) = n! * [x^n] exp(k * x/(1 - x))/(1 - x). Triangle read by rows, T(n, k) for 0 <= k <= n.at n=23A344048
- Triangle read by rows: T(n, k) = 2^k * hypergeom([-n, -k], [], 1/2).at n=27A375854