A119981 a(n) = 1 iff number congruent to {2, 4} mod 6 is equal to prime minus 3, otherwise a(n)=0.

1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0

Offset: 1

Author

Giovanni Teofilatto, Aug 03 2006

Keywords

• easy
• nonn

Comments

a(n) = 1 iff A047235(n) + 3 = A086801(n).

Crossrefs

Cf. A047235, A086801.