login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A254636
Numbers that cannot be represented as x*y + x + y, where x>=y>1.
10
0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 13, 16, 18, 21, 22, 25, 28, 30, 33, 36, 37, 40, 42, 45, 46, 52, 57, 58, 60, 61, 66, 70, 72, 73, 78, 81, 82, 85, 88, 93, 96, 100, 102, 105, 106, 108, 112, 117, 121, 126, 130, 133, 136, 138, 141, 145, 148, 150, 156, 157, 162, 165, 166, 172
OFFSET
1,3
COMMENTS
0, 7 and numbers n such that n+1 is either prime or twice a prime. - Robert Israel, Aug 05 2015
MAPLE
sort([0, 7, op(select(t -> isprime(t+1), [$1..10^4])), op(select(t -> isprime((t+1)/2), [2*i+1$i=1..5*10^3]))]); # Robert Israel, Aug 05 2015
MATHEMATICA
r[n_] := Reduce[x >= y > 1 && n == x y + x + y, {x, y}, Integers];
Reap[For[n = 0, n <= 200, n++, If[r[n] === False, Sow[n]]]][[2, 1]] (* Jean-François Alcover, Feb 28 2019 *)
PROG
(Python)
from sympy import primepi
def A254636(n):
def bisection(f, kmin=0, kmax=1):
while f(kmax) > kmax: kmax <<= 1
while kmax-kmin > 1:
kmid = kmax+kmin>>1
if f(kmid) <= kmid:
kmax = kmid
else:
kmin = kmid
return kmax
def f(x): return int(n-1+x-(x>=7)-primepi(x+1)-primepi(x+1>>1))
return bisection(f, n-1, n-1) # Chai Wah Wu, Oct 14 2024
CROSSREFS
Cf. A091529 (appears to be essentially the same, except first few terms).
Cf. A253975.
Sequence in context: A049809 A190278 A372477 * A165763 A178877 A011870
KEYWORD
nonn
AUTHOR
Alex Ratushnyak, Feb 03 2015
STATUS
approved