31290
domain: N
Appears in sequences
- a(n) = Sum_{d|n} p(d), where p(d) = A000041 = number of partitions of d.at n=38A047968
- Least even number m which can be written as sum of 2n primes p(1) < ... < p(2n) < m/2 such that m-p(i) is also prime for i=1,...,2n.at n=34A191837
- Number of ways to select 2 disjoint point triples from an n X n X n triangular point grid, each point triple forming an 2 X 2 X 2 triangle.at n=15A289223
- Numbers n for which 2 < A257993(A276086(A276086(n))) < A257993(n), where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument.at n=21A328762
- a(n) = (8*n^3 + 15*n^2 + 13*n)/6.at n=28A332698