|
Search: id:A092248
|
|
|
| A092248 |
|
Parity of number of distinct primes dividing n (function omega(n)) parity of A001221. |
|
+0
1
|
|
| 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Index entries for characteristic functions
|
|
FORMULA
|
If omega(n) is even then a(n)=0 else a(n)=1. By convention, a(1)=0.
|
|
EXAMPLE
|
n=1, a(1)=0
n=2, a(2)=1
n=3, a(3)=1
n=4=2^2, a(4)=1
n=5, a(5)=1
n=6=2*3, a(6)=0
|
|
PROGRAM
|
(PARI) for (i=1, 200, if(Mod(omega(i), 2)==0, print1(0, ", "), print1(1, ", ")))
|
|
CROSSREFS
|
Cf. A001221.
Sequence in context: A100656 A053867 A069513 this_sequence A106743 A011558 A100047
Adjacent sequences: A092245 A092246 A092247 this_sequence A092249 A092250 A092251
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Mohammed Bouayoun (mohammed.bouayoun(AT)sanef.com), Feb 19 2004
|
|
EXTENSIONS
|
Fixed offset. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 03 2008
|
|
|
Search completed in 0.002 seconds
|
