OFFSET
1,1
COMMENTS
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000
EXAMPLE
MAPLE
A002808 := proc(n) local a; if n = 1 then 4; else for a from procname(n-1)+1 do if not isprime(a) then RETURN(a) ; end if; end do; end if; end proc:
A163829 := proc(n) local c; c := A002808(n) ; pfs := ifactors(c)[2] ; mul( numtheory[pi](op(1, p))^op(2, p), p=pfs) ; end:
A163830 := proc(n) A002808(n)-A163829(n) ; end: seq(A163830(n), n=1..100) ; # R. J. Mathar, Aug 08 2009
MATHEMATICA
With[{nn=100}, #-Times@@(PrimePi/@Flatten[Table[#[[1]], {#[[2]]}]&/@ FactorInteger[#]])&/@Complement[Range[2, nn], Prime[Range[ PrimePi[ nn]]]]](* Harvey P. Dale, Mar 29 2012 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Juri-Stepan Gerasimov, Aug 05 2009
EXTENSIONS
Edited by R. J. Mathar, Jul 08 2009
STATUS
approved