19332

Appears in sequences

• Number of partitions satisfying (cn(2,5) = cn(3,5) and cn(2,5) <= cn(1,5) and cn(2,5) <= cn(4,5)).at n=52A036808
• Number of nonnegative solutions of x1^2 + x2^2 + ... + x10^2 = n.at n=20A045852
• Molien series for group H_{1,3}^{8} of order 2304.at n=40A051531
• a(n) = 3*(n - 2)*(5*n -11).at n=36A060785
• Fifth subdiagonal in array of n-gonal numbers A081422.at n=26A081436
• Number of 8k+-1 primes (A001132) in range [2^n,2^(n+1)].at n=18A095013
• Number of (directed) Hamiltonian circuits on the n-antiprism graph.at n=11A124353
• A129957(n) - n*(n-1)/2.at n=27A129959
• Number of sequences of length n with elements {-2,-1,+1,+2}, such that the sum of elements of the whole sequence but of no proper subsequence equals 0 modulo n. For n>=4, the number of Hamiltonian (directed) circuits on the circulant graph C_n(1,2).at n=23A137725
• Least m coprime to 5 minimizing A007947(m*(5^n-m)).at n=7A147803
• (A192249)/5.at n=10A192069
• Number of orbits of size 2n in vertex graph of Lucas cube Lambda_n.at n=28A250115
• Cardinality of the set of equivalence classes of the set X_n of finite integer sequences {x_1 = 0, x_2, ..., x_n} satisfying |x_k - x_{k+1}| = 1, where two such sequences are deemed equivalent if they are permutations of each other.at n=19A254007
• Number of ways to write n as an ordered sum of 9 primes (counting 1 as a prime).at n=11A341988
• Numbers k such that A307437(k) is divisible by 3.at n=33A342037
• Larger member of a nonexponential amicable pair: numbers (k, m) such that nesigma(k) = m and nesigma(m) = k, where nesigma(k) is the sum of the nonexponential divisors of k (A160135).at n=1A348603