37595

Appears in sequences

• a(n) = Sum_{k=0..n} S(k), where S(n) are the tribonacci generalized numbers A001644.at n=16A073728
• Numbers k such that 2^(2*k+1) + 2^k + 1 is prime.at n=42A105180
• a(n) = floor((n + 1/2)^3).at n=33A219085
• a(n) = floor(M(g(n-1)+1, ..., g(n))), where M = harmonic mean and g(n) = n^3.at n=33A227012
• Composite numbers n such that n+2 is also composite and such that (sopfr(n), sopfr(n+2)) is a twin prime pair. A001414 explains notation 'sopfr(n)'.at n=3A247048
• T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 4 and columns nondecreasing modulo 5.at n=23A264698
• Number of 3Xn arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 4 and columns nondecreasing modulo 5.at n=4A264700
• Repeated application of the Syracuse map over F_2[x] starting from 1+x^3, m = 1+x^2. Represented as the integers resulting from evaluating the polynomial at 2 over Z.at n=20A368120