OFFSET
1,2
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
PROG
(Python)
from sympy import integer_log
from oeis_sequences.OEISsequences import bisection
def A086286(n):
if n == 1: return 1
def f(x):
c = n+x
for i in range(integer_log(x, 7)[0]+1):
for j in range(integer_log(m:=x//7**i, 5)[0]+1):
for k in range(integer_log(r:=m//5**j, 3)[0]+1):
c -= (r//3**k).bit_length()
return c
m = bisection(f, n, n)
if m&1^1:
return 2
elif not m%3:
return 3
elif not m%5:
return 5
else:
return 7 # Chai Wah Wu, Mar 13 2026
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jul 15 2003
STATUS
approved
