OFFSET
1,1
LINKS
Bert Dobbelaere, Table of n, a(n) for n = 1..53
EXAMPLE
a(6) = 16.
16 mod 2 = 0 < 2/2
16 mod 3 = 1 < 3/2
16 mod 5 = 1 < 5/2
16 mod 7 = 2 < 7/2
16 mod 11 = 5 < 11/2
16 mod 13 = 3 < 13/2
16 is the smallest integer > 0 satisfying these inequalities for the first 6 primes.
PROG
(PARI) isok(k, vp) = {for (i=1, #vp, if ((k % vp[i]) >= vp[i]/2, return (0)); ); return (1); }
a(n) = {my(k=1, vp = primes(n)); while (!isok(k, vp), k++); k; } \\ Michel Marcus, Sep 08 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Bert Dobbelaere, Sep 07 2019
STATUS
approved