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.

Showing 1-2 of 2 results.

A124485 Numbers n such that 2n-1 and 4n-1 are primes.

Original entry on oeis.org

2, 3, 6, 12, 15, 21, 27, 42, 45, 57, 66, 87, 90, 96, 117, 120, 126, 141, 147, 180, 210, 216, 222, 246, 255, 297, 321, 327, 330, 342, 360, 372, 381, 405, 456, 477, 507, 510, 516, 525, 552, 612, 615, 645, 705, 720, 726, 741, 750, 756, 780, 792, 801, 867, 906, 945
Offset: 1

Views

Author

Artur Jasinski, Nov 04 2006

Keywords

Crossrefs

Cf. A005384 (Sophie Germain primes).

Programs

  • GAP
    Filtered([1..1000],p->IsPrime(2*p-1) and IsPrime(4*p-1)); # Muniru A Asiru, Jul 19 2018
  • Maple
    select(k->isprime(2*k-1) and isprime(4*k-1),[$1..1000]); # Muniru A Asiru, Jul 19 2018
  • Mathematica
    Select[Range[1000], And @@ PrimeQ /@ ({2, 4}*# - 1) &] (* Ray Chandler, Nov 21 2006 *)

Formula

a(n) = (A005384(n+1) + 1)/2. - Hilko Koning, Jul 19 2018

Extensions

Extended by Ray Chandler, Nov 21 2006

A124492 a(n) = least k such that 2*i*k - 1 is prime for 1 <= i <= n.

Original entry on oeis.org

2, 2, 2, 3, 3, 77385, 1447110, 1447110, 203937090, 107290072890, 4724240531010, 123618251967210, 1272603355923900, 9089306184994125090
Offset: 1

Views

Author

Artur Jasinski, Nov 04 2006

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Block[{k = If[n < 6, 1, 5], s}, s = k; While[! AllTrue[k  2 Range[n] - 1, PrimeQ], k += s]; k]; Array[a, 8] (* Giovanni Resta, Apr 01 2017 *)

Extensions

Corrected and extended by Don Reble, Nov 05 2006
a(12)-a(14) from Giovanni Resta, Apr 01 2017
Showing 1-2 of 2 results.