A369295 a(n) is the first number k such that Omega(k) = n and Omega(n - 1) = Omega(n + 1) = n + 1.

5, 51, 343, 3185, 75951, 1780624, 16825375, 212781249, 4613781249, 74239460225, 858245781249, 46055847109375, 487028345781249

Offset

1,1

Comments

a(n) is the first k such that k - 1, k and k + 1 have n + 1, n and n + 1 prime factors respectively, counted with multiplicity.

From David A. Corneth, Jan 19 2024: (Start)

a(9) <= 4613781249. This value is exact if 27000 divides lcm(a(9)-1, a(9), a(9)+1). Same goes for a(10) <= 104168181249.

a(11) <= 858245781249 if 810000 divides lcm(a(11)-1, a(11), a(11)+1). a(12) <= 46055847109375 if 24300000 divides lcm(a(12)-1, a(12), a(12)+1). (End)

Links

Table of n, a(n) for n=1..13.

Example

a(3) = 343 because 343 = 7^3 has 3 prime factors while 342 = 2 * 3^2 * 19 and 344 = 2^3 * 43 each have 4, and 343 is the least number that works.

Maple

V:= Vector(8): count:= 0:
b:= 0: c:= 1:
for n from 3 do
  a:= b; b:= c; c:= numtheory:-bigomega(n);
  if a = b+1 and c = b+1 and b <= 8 and V[b] = 0 then
    V[b]:= n-1; count:= count+1; if count = 8 then break fi;
  fi
od:
convert(V, list);

Prog

(PARI)
generate(A, B, n) = A=max(A, 2^n); (f(m, p, k) = my(list=List()); if(k==1, forprime(q=max(p, ceil(A/m)), B\m, my(t=m*q); if(bigomega(t+2) == n && bigomega(t+1) == n-1, listput(list, t+1))), forprime(q = p, sqrtnint(B\m, k), list=concat(list, f(m*q, q, k-1)))); list); vecsort(Vec(f(1, 2, n)));
a(n) = my(x=2^n, y=2*x); while(1, my(v=generate(x, y, n+1)); if(#v >= 1, return(v[1])); x=y+1; y=2*x); \\ Daniel Suteu, Jan 19 2024

Crossrefs

Cf. A001222, A322300.

Sequence in context: A208997 A041043 A362516 * A145641 A317782 A342407

Adjacent sequences: A369292 A369293 A369294 * A369296 A369297 A369298

Keyword

nonn,more

Author

Zak Seidov and Robert Israel, Jan 18 2024

Extensions

a(9)-a(11) from Daniel Suteu, Jan 19 2024

a(12)-a(13) from Martin Ehrenstein, Feb 12 2024

Status

approved