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.

A116612 Values of n such that p(2n+1) mod 12 = 1, where p(j) denotes the j-th prime.

Original entry on oeis.org

10, 12, 14, 18, 26, 29, 32, 60, 63, 72, 73, 75, 79, 84, 91, 93, 94, 95, 98, 101, 105, 110, 115, 118, 125, 128, 131, 135, 136, 137, 139, 143, 147, 150, 159, 165, 168, 169, 170, 173, 177, 180, 184, 187, 195, 200, 203, 205, 207, 212, 215, 217, 218, 221, 222, 224
Offset: 1

Views

Author

Roger L. Bagula, Mar 29 2006

Keywords

Examples

			29 is in the sequence because the 59th prime is 277 and 277 mod 12=1.
		

Crossrefs

Programs

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

Formula

A116612 = integer part of 1/2 * { odd terms in A160594 = A000720(A068228) }. - M. F. Hasler, May 22 2009

Extensions

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