229635
domain: N
Appears in sequences
- Largest order of automorphism group of a tournament with n nodes.at n=25A000198
- Denominators of coefficients of Green function for cubic lattice.at n=4A003302
- Sextuple factorial numbers: a(n) = Product_{k=0..n-1} (6*k+3).at n=5A011781
- Triangle of coefficients in expansion of (1+9x)^n.at n=32A013616
- Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*9^j.at n=19A038275
- Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*1^j.at n=31A038291
- Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*7^j.at n=16A038297
- Odd numbers divisible by exactly 10 primes (counted with multiplicity).at n=5A046323
- Sextuple factorials, 6-factorials, n!!!!!!, n!6.at n=27A085158
- Denominator of I(n)=integral_{x=0 to 1/n}(x^2-1)^3 dx.at n=2A094075
- Denominators of power series arising in random graphs.at n=8A141143
- Triangle T(n, k) = Product_{j=0..k} (j*n + prime(m)), with T(n, 0) = prime(m) and m = 2, read by rows.at n=25A153270
- A Minkowski-type generalization of the factorial function: F(n,k) with k = 2.at n=9A163402
- a(n) = binomial(n + 3, 3)*9^n.at n=4A173187
- Triangle, read by rows, T(n, k) = (-1)^k * (n-k+1)^(n+2) * binomial(n+1, k).at n=25A176860
- Number of divisors of the n-th positive number that is both triangular and square.at n=23A242585
- Number of (n+2) X (1+2) 0..3 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=25A253018
- Common denominator of coefficients in Nörlund's polynomial D_{2n}(x).at n=13A260326
- Numbers n such that the decimal digits of n^2 are all prime.at n=30A275971
- a(n) = (1/4!)*3^(n+2)*(n+7)*(n+2)*(n+1)*(n).at n=4A288838