OFFSET
1,1
COMMENTS
LINKS
Bill McEachen, Table of n, a(n) for n = 1..10000
EXAMPLE
n = 1: composite(1) = 4; (largest prime divisor of 4) = (smallest prime divisor 4) = 2; 2 mod 2 = 0. Hence a(1) = 4+0 = 4.
n = 5: composite(5) = 10; (largest prime divisor of 10) = 5; (smallest prime divisor 10) = 2; 5 mod 2 = 1. Hence a(5) = 10+1 = 11.
PROG
(Magma) [ n + D[ #D] mod D[1]: n in [2..100] | not IsPrime(n) where D is PrimeDivisors(n) ];
(PARI) genit(maxx=1000)={ctr=0; arr=List(); forcomposite(k=4, +oo, v=factor(k)[, 1]; r=v[#v]%v[1]; ctr+=1; if(ctr>=maxx, break); listput(arr, k+r)); arr} \\ Bill McEachen, Nov 17 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Klaus Brockhaus, Jun 23 2009
STATUS
approved