27015

Appears in sequences

• a(n) = 8*n^3 + n.at n=15A118465
• Numbers k such that 3k-4, 3k-2, 3k+2, and 3k+4 are primes.at n=33A173092
• Numbers k such that k^3 divides 14^(k^2) + 1.at n=21A177814
• Number of 0..n arrays x(0..3) of 4 elements with zero 3rd differences.at n=43A200155
• Number of (n+2)X(1+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 3, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=4A253335
• Number of (n+2)X(5+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 3, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=0A253339
• T(n,k)=Number of (n+2)X(k+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 3, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=10A253342
• T(n,k)=Number of (n+2)X(k+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 3, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=14A253342
• Number of 4 X n 0..1 arrays with every element equal to 0, 1, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=12A302637