A381763 a(n) is the greatest k >= 0 such that Omega(n-i) = Omega(n+i) for 1 <= i <= k, where Omega = A001222.

0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 2, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0

Offset

2,4

Links

Robert Israel, Table of n, a(n) for n = 2..10000

Example

a(12) = 3 because Omega(11) = Omega(13) = 1, Omega(10) = Omega(14) = 2 and Omega(9) = Omega(15) = 2 but Omega(8) = 3 while Omega(16) = 4.

Maple

f:= proc(n) local k;
  for k from 1 do
    if numtheory:-bigomega(n-k) <> numtheory:-bigomega(n+k) then return k-1 fi
  od
end proc:
map(f, [$2..100]);

Crossrefs

Cf. A001222, A381768.

Sequence in context: A091396 A173677 A219480 * A277627 A037857 A037875

Adjacent sequences: A381760 A381761 A381762 * A381764 A381765 A381766

Keyword

nonn

Author

Robert Israel, Mar 06 2025

Status

approved