31128
domain: N
Appears in sequences
- T(n,n-6), where T is the array in A055830.at n=14A055833
- Length of lists created by n substitutions k -> Range[ -Floor[Abs[k]/2],Floor[Abs[k]+3/2]] starting with {0}.at n=9A084082
- Largest achievable determinant of a 3 X 3 matrix whose elements are 9 distinct integers chosen from the range -n...n.at n=17A097693
- Structured truncated octahedral numbers.at n=17A100155
- Poincaré series [or Poincare series] P(C_{3,2}(0); t).at n=33A124636
- Numbers k such that 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*(k+5)*p(k+6)-1 and 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*(k+5)*p(k+6)+1 are twin primes with p(h) = h-th prime.at n=19A129313
- a(n) = the definite integral Integral_{0..1} Product_{j=1..n} 4*sin^2(Pi*j*x) dx.at n=27A133871
- a(n) = 1728*n + 24.at n=17A157325
- Number of distinct solutions of sum{i=1..3}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 1..n-1.at n=17A180785
- Half the number of n X 4 binary arrays with no element unequal to a strict majority of its king-move neighbors.at n=15A183388
- Numbers k such that 9*R_(k+2) - 7*10^k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=15A257037
- G.f. = Phi^4, where Phi = g.f. for A028930.at n=41A328529
- Number of nonequivalent symmetric sets whose translations cover {1..n}.at n=30A329235
- Maximal coefficient of (1 - x)^2 * (1 - x^2)^2 * (1 - x^3)^2 * ... * (1 - x^n)^2.at n=28A369710