cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A116613 Values of n such that prime(2n+1) mod 12 = 5.

Original entry on oeis.org

1, 3, 6, 16, 17, 22, 25, 27, 28, 35, 38, 39, 43, 44, 48, 56, 59, 61, 67, 68, 69, 82, 99, 100, 104, 111, 113, 122, 127, 129, 132, 133, 145, 146, 156, 161, 162, 171, 172, 176, 179, 183, 186, 189, 190, 202, 209, 210, 234, 238, 250, 251, 258, 261, 272, 275, 280, 284
Offset: 1

Views

Author

Roger L. Bagula, Mar 29 2006

Keywords

Examples

			25 is in the sequence because the 51st prime is 233 and 233 mod 12 = 5.
		

Crossrefs

Programs

  • Maple
    a:=proc(n) if ithprime(2*n+1) mod 12 = 5 then n else fi end: seq(a(n),n=0..300);
  • Mathematica
    Select[Range[0, 500], Mod[Prime[2*# + 1], 12] == 5 &] (* G. C. Greubel, Nov 19 2017 *)
  • PARI
    for(n=1,999, prime(2*n+1)%12==5 & print1(n",")) \\ M. F. Hasler, May 22 2009

Formula

Equals the integer part of { odd terms in A160591 = A000720(A040117) } / 2. - M. F. Hasler, May 22 2009

Extensions

Edited by N. J. A. Sloane, Apr 05 2006