|
Search: id:A162289
|
|
|
| A162289 |
|
a(n) = 1 if n is relatively prime to 30 else 0. |
|
+0
1
|
|
| 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
Euler transform of length 30 sequence [ 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, -1, 0, 0, 0, 0, 0, 1].
Moebius transform is length 30 sequence [ 1, -1, -1, 0, -1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1].
a(n) is multiplicative with a(2^e) = a(3^e) = a(5^e) = 0^e, a(p^e) = 1 if p>5.
a(-n) = a(n + 30) = a(n).
G.f.: x * (1 + x^6) * (1 + x^10) * (1 + x^12) / (1 - x^30).
|
|
EXAMPLE
|
x + x^7 + x^11 + x^13 + x^17 + x^19 + x^23 + x^29 + x^31 + x^37 + ...
|
|
PROGRAM
|
(PARI) {a(n) = 1 == gcd(30, n)}
|
|
CROSSREFS
|
Sequence in context: A014189 A079979 A089010 this_sequence A122276 A066288 A111412
Adjacent sequences: A162286 A162287 A162288 this_sequence A162290 A162291 A162292
|
|
KEYWORD
|
nonn,mult
|
|
AUTHOR
|
Michael Somos, Jun 29 2009
|
|
|
Search completed in 0.008 seconds
|
