60340
domain: N
Appears in sequences
- Nearest k to j such that k*(2^j-1)+1 is prime where j=A000043(n) and 2^j-1 = Mersenne-prime(n) = A000668(n). If there are two k values equidistant from j, each of which produces a prime, the larger of the two gets added to the sequence.at n=26A159585
- Number of nX3 0..2 arrays with no element equal to exactly three horizontal or vertical neighbors, with new values 0..2 introduced in row major order.at n=3A241109
- Number of nX4 0..2 arrays with no element equal to exactly three horizontal or vertical neighbors, with new values 0..2 introduced in row major order.at n=2A241110
- T(n,k)=Number of nXk 0..2 arrays with no element equal to exactly three horizontal or vertical neighbors, with new values 0..2 introduced in row major order.at n=17A241114
- T(n,k)=Number of nXk 0..2 arrays with no element equal to exactly three horizontal or vertical neighbors, with new values 0..2 introduced in row major order.at n=18A241114
- Numbers n such that 13^n is the highest power of 13 dividing A240751(n).at n=27A286007