|
|
A120676
|
|
Number of prime factors of even squarefree numbers A039956.
|
|
1
|
|
|
1, 2, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 3, 3, 2, 3, 2, 2, 2, 3, 2, 3, 3, 2, 2, 3, 2, 3, 2, 2, 3, 2, 2, 3, 3, 2, 3, 3, 3, 2, 2, 2, 4, 2, 2, 3, 2, 3, 3, 3, 2, 3, 2, 3, 2, 2, 3, 3, 3, 2, 2, 3, 2, 3, 3, 2, 4, 2, 2, 3, 2, 2, 3, 3, 3, 2, 2, 4, 2, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 2, 2, 4, 2, 3, 3, 2, 2, 3, 3, 2, 3, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
issquarefree := proc(n::integer) local nf, ifa ; nf := op(2, ifactors(n)) ; for ifa from 1 to nops(nf) do if op(2, op(ifa, nf)) >= 2 then RETURN(false) ; fi ; od : RETURN(true) ; end: A001221 := proc(n::integer) RETURN(nops(numtheory[factorset](n))) ; end: A039956 := proc(maxn) local n, a ; a := [2] ; for n from 4 to maxn by 2 do if issquarefree(n) then a := [op(a), n] ; fi ; od : RETURN(a) ; end: A120676 := proc(maxn) local a, n; a := A039956(maxn) ; for n from 1 to nops(a) do a := subsop(n=A001221(a[n]), a) ; od ; RETURN(a) ; end: nmax := 600 : a := A120676(nmax) : for n from 1 to nops(a) do printf("%d, ", a[n]) ; od ; # R. J. Mathar, Aug 17 2006
|
|
MATHEMATICA
|
PrimeOmega/@Select[2*Range[300], SquareFreeQ] (* Harvey P. Dale, Jul 28 2019 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|