43225
domain: N
Appears in sequences
- Sextuple factorial numbers: Product_{k=0..n-1} (6*k+1).at n=5A008542
- a(n) = n*(n+1)*(2*n+1)*(3*n+1)*(4*n+1)/6.at n=6A011197
- a(n) = (n+1)*(2*n+1)*(3*n+1)*(4*n+1).at n=6A011245
- Partial sums of A007584.at n=18A051740
- Sextuple factorials, 6-factorials, n!!!!!!, n!6.at n=25A085158
- Triangle of numbers related to triangle A092083; generalization of Stirling numbers of second kind A008277, Lah-numbers A008297, ...at n=10A092082
- Expansion of (1-x)/((1-2*x)*(1-2*x-x^2)).at n=11A106514
- a(n) = A001333(n) - (-2)^(n-1), n > 0.at n=12A111108
- Least common multiple of {1, 7, 13, 19, 25, ..., (6n+1)} (A016921).at n=4A131940
- Multiples of 1729, the Hardy-Ramanujan number.at n=25A138129
- Quadruple lucky numbers (lower terms). Numbers n such that n, n+2, n+6, n+8 are all Lucky numbers.at n=31A139783
- Square array T(n,m) = Product_{i=0..m} (1+n*i) read by antidiagonals.at n=61A142589
- Triangle T(n,k) = Product_{j=0..k} n*j+1.at n=25A153189
- Triangle T(n, k) = Product_{j=0..k} (j*n + prime(m)), with T(n, 0) = prime(m) and m = 4, read by rows.at n=24A153272
- a(n) = (n+1)^n * n! * binomial(n-1 + 1/(n+1), n).at n=5A158887
- Number of cubic plane graphs with 2n nodes, minimal face size 3 and maximal face size 6.at n=33A219747
- Triangle S(n,k) by rows: coefficients of 6^((n-1)/2)*(x^(1/6)*d/dx)^n when n is odd, and of 6^(n/2)*(x^(5/6)*d/dx)^n when n is even.at n=24A223172
- Triangle S(n,k) by rows: coefficients of 6^((n-1)/2)*(x^(1/6)*d/dx)^n when n is odd, and of 6^(n/2)*(x^(5/6)*d/dx)^n when n is even.at n=29A223172
- Triangle S(n,k) by rows: coefficients of 6^((n-1)/2)*(x^(1/6)*d/dx)^n when n=1,3,5,...at n=10A223531
- Triangle S(n,k) by rows: coefficients of 6^(n/2)*(x^(5/6)*d/dx)^n when n=0,2,4,6,...at n=15A223532