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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A161491 a(n) = number of primes p less than A000040(n) (the n-th prime) such that (p + 1)*(A000040(n) - 1) is a square 0
 0, 0, 1, 1, 0, 2, 1, 2, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 4, 0, 0, 0, 3, 1, 1, 0, 4, 0, 1, 0, 0, 1, 0, 4, 0, 6, 0, 0, 0, 3, 0, 5, 1, 1, 0, 0, 0, 1, 0, 0, 2, 1, 1, 0, 0, 2, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 2, 0, 0, 1, 1, 1, 0, 1, 0, 6, 0, 0, 1, 1, 0, 1, 0, 0, 6, 2, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS PROG (PARI) forprime(q=1, 1000, my(q1=q-1, c=0); forprime(p=1, q-1, issquare((p+1)*q1)&c++); print1(c", ")) - M. F. Hasler CROSSREFS Sequence in context: A035186 A035194 A245818 * A332998 A301652 A030203 Adjacent sequences:  A161488 A161489 A161490 * A161492 A161493 A161494 KEYWORD nonn AUTHOR Creighton Dement, Jun 11 2009 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 May 19 11:44 EDT 2022. Contains 353833 sequences. (Running on oeis4.)