39600

Appears in sequences

• Theta series of extremal even unimodular lattice in dimension 40.at n=2A004671
• Number of strict (-1)st-order maximal independent sets in cycle graph.at n=21A007390
• a(n) = Lucas(n+2) - 3.at n=19A027961
• Smallest number that is palindromic (with at least 2 digits) in n bases.at n=45A037183
• Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= n/3.at n=36A048002
• Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n-1)/3.at n=36A048015
• Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n+1)/3.at n=36A048048
• Differences of two factorial numbers.at n=23A051949
• Take n-th palindromic prime p, let P = all primes having same digits; a(n) = q-p where q is smallest prime in P >p if q exists; otherwise a(n) = p-r where r is largest prime in P <p if r exists; otherwise a(n) = 0.at n=38A052507
• E.g.f. x(1-x)^2/(1-3x+x^2).at n=6A052623
• Numbers n such that phi(n) is a proper substring of n.at n=11A066663
• Numbers n such that the digits of n end in phi(n).at n=12A067206
• Numbers n such that sigma(n)^2 > 9*sigma_2(n) where sigma_2(n) is the sum of squares over the divisors of n.at n=18A068378
• Denominators of expansion of 1/x+1/log(1-x).at n=19A075178
• a(n) = Lucas(4*n+2) - 3 = 5*Fibonacci(2*n)*Fibonacci(2*n+2).at n=5A081079
• Compute S, the number of different quadratic residues modulo B for every base B. If the density S/B is smaller for B than for every B' less than B, then B is added to the sequence.at n=37A085635
• Numbers containing squares of Pythagorean triples in their divisor set.at n=10A096472
• Number triangle T(n,k) = C(n,n-k)*C(n+1,n-k).at n=58A103371
• a(n) = (n+1)^2*(n+2)^2*(n+3)^2*(n+4)/144.at n=7A108647
• Partial sum of A005915.at n=14A126274