125218
domain: N
Appears in sequences
- Numbers k such that 63*2^k+1 is prime.at n=47A032381
- Solution to the problem of finding the number of comparisons needed for optimal merging of 3 elements with n elements.at n=48A239100
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=5A316880
- Number of n X 6 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=4A316881
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=49A316883
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=50A316883
- Numbers k such that prime(k), prime(k+1), prime(k+2), prime(k+3) and prime(k+4) all have the same last digit.at n=30A371390