25097

Properties

Appears in sequences

• Generalized Bell numbers: column 4 of A275043.at n=4A061685
• Smallest prime p such that M(n)^2+p*M(n)+1 is prime with M(n)= Mersenne primes =A000668(n).at n=18A139431
• Primes congruent to 26 mod 61.at n=39A142824
• Primes of the form 2*k^2 + 9.at n=42A201476
• Primes of the form 8n^2 + 9.at n=22A201705
• a(n) is the smallest prime in the interval [k*sqrt(k), k*sqrt(k+2)], where k = A001359(n), or a(n)=0 if there is no prime in this interval.at n=33A247867
• Number A(n,k) of set partitions of [k*n] such that within each block the numbers of elements from all residue classes modulo k are equal for k>0, A(n,0)=1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=40A275043
• Number of set partitions of [n^2] such that within each block the numbers of elements from all residue classes modulo n are equal for n>0, a(0)=1.at n=4A275044
• Number of set partitions of [4*n] such that within each block the numbers of elements from all residue classes modulo n are equal for n>0, a(0)=1.at n=4A275101
• Number of n X 5 0..1 arrays with every element equal to 0, 1, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=6A299191
• Number of nX7 0..1 arrays with every element equal to 0, 1, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=4A299193
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=59A299194
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=61A299194
• Numbers k such that 449*2^k+1 is prime.at n=21A323194
• Prime numbersat n=2770