The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A156311 Number of ways to write prime(n) = prime(k) + prime(k+1)*m. 4
 0, 0, 1, 0, 1, 1, 1, 1, 2, 2, 0, 1, 1, 1, 3, 2, 1, 1, 0, 1, 2, 0, 2, 3, 0, 1, 2, 1, 0, 2, 1, 3, 2, 2, 2, 0, 1, 1, 2, 3, 2, 1, 1, 2, 2, 0, 0, 1, 2, 1, 2, 1, 0, 2, 2, 2, 1, 3, 1, 1, 4, 3, 1, 1, 3, 2, 0, 1, 1, 1, 3, 3, 1, 1, 0, 3, 3, 2, 4, 0, 2, 1, 1, 2, 2, 2, 1, 0, 1, 3, 2, 3, 1, 2, 0, 2, 3, 1, 3, 1, 2, 5, 3, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 COMMENTS a(n) = #{k: prime(n) mod prime(k+1) = prime(k)}; a(A049084(A156312(n)))>0; a(A049084(A156313(n)))=0; a(A049084(A156314(n)))=n and a(m)

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

Last modified September 22 03:12 EDT 2020. Contains 337289 sequences. (Running on oeis4.)