93240

Appears in sequences

• a(n) = (n+2)!/4 + n!/2.at n=7A006595
• a(n) = floor(n(n-1)(n-2)(n-3)/19).at n=38A011929
• Triangle T(n,k) arising from enumeration of permutations with ordered orbits, read by rows (1<=k<=n).at n=37A059418
• Values of n such that N=(an+1)(bn+1)(cn+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,33.at n=21A064253
• Numbers j such that j and 2j are both between a pair of twin primes.at n=28A066388
• Triangle T(n,k) read by rows, where e.g.f. for T(n,k) is exp(x*y)*log(1+x)/(1-x).at n=49A073480
• Irregular triangle from the expansion of p(x,t) = exp(x*t)/(x - t/2 - t/(exp(t) - 1)).at n=43A138169
• Numbers with prime factorization p*q*r*s^2*t^3 (where p, q, r, s, t are distinct primes).at n=27A190111
• Numbers m such that exactly four subsets of {m-1, m, m+1} sum up to a prime number.at n=31A221310
• Number of 2 X 2 matrices with entries in {0,1,...,n} with determinant = permanent with no entries repeated.at n=37A280058
• Expansion of e.g.f. Product_{k>0} (1-k*x^k)^(-1/k).at n=7A294462
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f.: Product_{j>0} 1/(1-j^k*x^j)^(1/j).at n=43A294761
• a(n) is the smallest number with exactly n divisors that are Moran numbers, or -1 if no such number exists.at n=15A333457
• a(n) is the least x such that x-1 and x+1 are prime and there are exactly n primes of the form x-1+t or x+1+t where t divides x.at n=32A340170
• Triangle T(n,k) read by rows: the number of traceless symmetric binary n X n matrices with 2k one's and no all-1 2 X 2 submatrix.at n=42A352472
• Expansion of e.g.f. 1/(1 - Sum_{k>=1} x^(k^2) / (k^2)).at n=8A353184
• a(n) is the smallest number k that is divisible by all numbers d with d < p = prime(n), and such that all of k+1, k-1, k+p, k-p are prime.at n=2A354882