OFFSET
1,2
COMMENTS
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..10000
Michael De Vlieger, Log log scatterplot of a(n), n = 1..74468.
Michael De Vlieger, Efficient Mathematica constructor program for A055932
MATHEMATICA
(* Load function f in the linked constructor a-file *)
Differences@ Union@ Flatten@ f[8]
PROG
(Python)
from functools import lru_cache
from itertools import count
from sympy import prime, integer_log, primorial
from oeis_sequences.OEISsequences import bisection
def A376690(n):
@lru_cache(maxsize=None)
def g(x, m): return sum(g(x//(prime(m)**i), m-1) for i in range(1, integer_log(x, prime(m))[0]+1)) if m-1 else x.bit_length()-1
def f(x):
c = n-1+x
for k in count(1):
if primorial(k)>x:
break
c -= g(x, k)
return c
return -(m:=bisection(f, n, n))+bisection(lambda x:f(x)+1, m, m) # Chai Wah Wu, Mar 18 2026
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Michael De Vlieger, Oct 13 2024
STATUS
approved
