38599

Appears in sequences

• Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Sequence gives values of z in monotonic increasing order.at n=23A050791
• Totally multiplicative sequence with a(p) = 6p-1 for prime p.at n=39A166655
• Weighted sum of all cyclic subgroups of the Alternating Group A_n.at n=7A181950
• a(n) = n^3*(5*n+3)/2.at n=11A229146
• Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 4 6 or 7.at n=5A252098
• Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 4 6 or 7.at n=0A252103
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 4 6 or 7.at n=15A252105
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 3 4 6 or 7.at n=20A252105
• Numbers n such that n^3 contains the consecutive substring 2,3,5,7.at n=37A295900
• Nonsquarefree numbers k such that A003415(k) divides A276086(k), where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.at n=46A371085