23083

Appears in sequences

• Numbers k such that 1000000000k+1, 1000000000k+3, 1000000000k+7, 1000000000k+9 are all primes.at n=3A064968
• a(n) = n*(14*n - 11).at n=41A195021
• a(n) = (n-2)*(14*n-39) for n > 2, otherwise a(n) = n.at n=43A195030
• Number of n X 5 0..2 arrays with every 1 immediately preceded by 0 to the left or above, no 0 immediately preceded by a 0, and every 2 immediately preceded by 0 1 to the left or above.at n=6A203178
• Number of nX7 0..2 arrays with every 1 immediately preceded by 0 to the left or above, no 0 immediately preceded by a 0, and every 2 immediately preceded by 0 1 to the left or above.at n=4A203180
• T(n,k) is the number of n X k 0..2 arrays with every 1 immediately preceded by 0 to the left or above, no 0 immediately preceded by a 0, and every 2 immediately preceded by 0 1 to the left or above.at n=59A203181
• T(n,k) is the number of n X k 0..2 arrays with every 1 immediately preceded by 0 to the left or above, no 0 immediately preceded by a 0, and every 2 immediately preceded by 0 1 to the left or above.at n=61A203181
• Composite numbers and 1 which yield a prime whenever a 3 is inserted anywhere in them (including at the beginning or end).at n=24A216166
• a(n) = number of steps to reach 0 when starting from k = (n^3)-1 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.at n=57A261228
• Number of perforated polyominoes with n cells, identifying mirror images.at n=13A294151
• Numbers n such that A307042(n) = Sum_{k=1..n} esigma(k) is divisible by n, where esigma(k) is sum of exponential divisors of k (A051377).at n=11A307043