The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A140366 a(n) = isprime(6n-1) + 2*isprime(6n-5), where isprime = A010051. 0
 1, 3, 3, 3, 1, 2, 3, 3, 1, 1, 2, 3, 2, 3, 1, 0, 3, 3, 3, 0, 0, 3, 1, 2, 1, 2, 2, 3, 1, 1, 2, 1, 3, 2, 0, 2, 0, 3, 3, 1, 2, 1, 1, 1, 1, 2, 3, 2, 1, 0, 0, 3, 3, 0, 0, 2, 2, 1, 3, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The idea is to consider 2-bit words, where the least resp. most significant bit correspond to primality of the respective member in the couple (6n-1,6n-5). (It might have been more natural to inverse the correspondences, i.e. to associate the LSB to the smaller number of the pair.) - M. F. Hasler, Jun 16 2008 LINKS Table of n, a(n) for n=1..60. PROG (PARI) a(n)=isprime(6*n-5)<<1+isprime(6*n-1) \\ M. F. Hasler, Jun 16 2008 CROSSREFS Cf. A002476, A007528. Sequence in context: A172364 A323596 A323375 * A167817 A153401 A181520 Adjacent sequences: A140363 A140364 A140365 * A140367 A140368 A140369 KEYWORD nonn AUTHOR Juri-Stepan Gerasimov, Jun 10 2008 EXTENSIONS Edited by M. F. Hasler, Jun 16 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 4 06:57 EST 2023. Contains 367557 sequences. (Running on oeis4.)