OFFSET
1,1
COMMENTS
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 1..65 (full sequence)
MAPLE
A145538:=Array([seq(0, j=1..65)]): lim:=10^5: p:=Array([seq(ithprime(j), j=1..65)]): for n from 4 to lim do if(isprime(n))then n:=n+1: fi: for k from 1 to 65 do if(n mod p[k] = 0)then A145538[k]:=A145538[k]+1: break: fi: od: od: seq(A145538[j], j=1..65); # Nathaniel Johnston, Jun 23 2011
MATHEMATICA
f3[k_Integer?Positive, i_Integer?Positive] := Module[{f, m, r, p}, p = Transpose[{r = Range[2, i], Prime[r]}]; f[x_] := Catch[Fold[If[Mod[x, #2[[2]]] == 0, Throw[m[ #2[[1]]] = m[ #2[[1]]] + 1], #1] &, If[Mod[x, 2] == 0, Throw[m[1] = m[1] + 1]], p]]; Table[m[n] = -1, {n, i}]; f /@ Range[k]; Table[m[n], {n, i}]]; nn = 5; kk = PrimePi[Sqrt[10^nn]]; t3 = f3[10^nn, kk] (* Bob Hanlon (hanlonr(AT)cox.net) *)
CROSSREFS
KEYWORD
fini,full,nonn
AUTHOR
Artur Jasinski with assistance from Bob Hanlon (hanlonr(AT)cox.net), Oct 14 2008
EXTENSIONS
Edited by Rick L. Shepherd, Mar 02 2013
STATUS
approved