login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A215480
Characteristic function of numbers n with exactly two distinct prime factors.
4
0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1
OFFSET
1
COMMENTS
Characteristic function of numbers A007774.
Sum_{n>=1} a(n)/n^s = Sum_(A001221(n)=2, 1/n^s) = 1/2((Sum_(p prime, 1/(p^s-1))^2 - Sum_(p prime, 1/(p^s-1)^2)). - Enrique Pérez Herrero, Aug 14 2012
LINKS
Enrique Pérez Herrero, Table of n, a(n) for n = 1..5000
FORMULA
a(n) = (1-floor(1/A001221(n)))*floor(2/A001221(n)), n > 1.
MATHEMATICA
Table[Boole[PrimeNu[n]==2], {n, 1, 200}]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved