55661

Properties

Appears in sequences

• First term of weak prime sextet: p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2) < p(m+4)-p(m+3) < p(m+5)-p(m+4).at n=17A054828
• Let f(m) = smallest prime that divides k^2 + k + m for k = 0,1,2,...; sequence gives smallest m >= 2 such that f(m) is the n-th prime, or -1 if no such m exists.at n=13A060380
• Let f(m) = smallest prime that divides k^2 + k + m for k = 0,1,2,...; sequence gives smallest m >= 0 such that f(m) is the n-th prime.at n=13A060392
• Primes of the form k^2 + k + 55661, with k >= 0.at n=0A116206
• Primes p such that the polynomial x^2 + x + p generates only primes for x = 0, ..., 4.at n=29A187057
• Primes p such that the polynomial x^2 + x + p generates only primes for x = 1..5.at n=12A187058
• Initial primes of 5 consecutive primes with consecutive gaps 2, 4, 6, 8.at n=13A190814
• Initial primes of 6 consecutive primes with consecutive gaps 2,4,6,8,10.at n=3A190817
• Prime numbers p such that x^2 + x + p produces primes for x = 0..5 but not x = 6.at n=5A210364
• Number of n X 2 binary arrays indicating whether each 2 X 2 subblock of a larger binary array has lexicographically increasing rows and columns, for some larger (n+1) X 3 binary array with rows and columns of the latter in lexicographically nondecreasing order.at n=21A227085
• Primes of the form 2*n^2 + 62*n + 29.at n=35A243891
• Numbers k such that n^2 + n + k has no prime factor p <= 41 for any integer n.at n=2A323558
• Addends k > 0 such that the polynomial x^2 + x + k produces a record of its Hardy-Littlewood Constant.at n=7A331940
• Number of strict odd-length integer partitions of 2n.at n=42A344650
• Consecutive internal states of the linear congruential pseudo-random number generator (421*s + 54773) mod 259200 when started at 1.at n=20A383129
• Primes having only {1, 5, 6} as digits.at n=25A385779
• Prime numbersat n=5647