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-7 of 7 results.

A224489 Smallest k such that k*2*p(n)^2-1 is prime.

Original entry on oeis.org

1, 1, 3, 1, 1, 1, 1, 4, 4, 6, 4, 6, 1, 1, 9, 10, 1, 6, 4, 7, 1, 4, 3, 4, 3, 10, 4, 4, 1, 1, 1, 10, 1, 7, 6, 12, 1, 9, 6, 3, 1, 1, 6, 3, 1, 1, 1, 3, 3, 4, 4, 21, 4, 1, 3, 1, 6, 4, 1, 10, 3, 1, 15, 1, 3, 4, 9, 13, 10, 9, 1, 4, 1, 3, 1, 3, 12, 9, 6, 1, 1, 22, 4, 1
Offset: 1

Views

Author

Pierre CAMI, Apr 08 2013

Keywords

Examples

			1*2*2^2-1=7 is prime, p(1)=2 so a(1)=1.
1*2*3^2-1=17 is prime, p(2)=3 so a(2)=1.
1*2*5^2-1=49 is composite; 2*2*5^2-1=99 is composite; 3*2*5^2-1=149 is prime, p(3)=5 so a(3)=3.

Links

Crossrefs

Cf. A224490, A224491, A224492.

Programs

  • Magma
    S:=[];
k:=1;
for n in [1..90] do
  while not IsPrime(k*2*NthPrime(n)^2-1) do
       k:=k+1;
  end while;
  Append(~S, k);
  k:=1;
end for;
S; // Bruno Berselli, Apr 18 2013
  • Mathematica
    a[n_] := For[k = 1, True, k++, If[ PrimeQ[k*2*Prime[n]^2 - 1], Return[k]]]; Table[a[n], {n, 1, 100}] (* Jean-François Alcover, Apr 10 2013 *)

A224490 Smallest k such that k*2*p(n)^2-1=q is prime and k*2*q^2-1 is also prime.

Original entry on oeis.org

1, 1, 25, 9, 21, 3, 1, 16, 25, 136, 10, 33, 90, 250, 10, 55, 1, 9, 36, 75, 1, 4, 33, 406, 103, 15, 121, 4, 244, 78, 28, 19, 49, 105, 45, 34, 10, 46, 33, 4, 111, 15, 9, 36, 118, 66, 10, 13, 31, 76, 66, 36, 55, 15, 4, 48, 6, 66, 13, 34, 54, 64, 153, 1, 60, 48
Offset: 1

Views

Author

Pierre CAMI, Apr 08 2013

Keywords

Examples

			1*2*2^2-1=7 prime q 1*2*7^2-1=97 also prime so a(1)=1.

Links

Crossrefs

Cf. A224489, A224491, A224492.

Programs

  • Mathematica
    a[n_] := For[k = 1, True, k++, p = Prime[n]; If[PrimeQ[q = k*2*p^2 - 1] && PrimeQ[k*2*q^2 - 1], Return[k]]]; Table[a[n], {n, 1, 66}] (* Jean-François Alcover, Apr 12 2013 *)

Extensions

Typo in name fixed by Zak Seidov, Apr 11 2013

A224492 Smallest k such that k*2*p(n)^2-1=q is prime, k*2*q^2-1=r, k*2*r^2-1=s, k*2*r^2-1=t, r, s, and t are also prime.

Original entry on oeis.org

5103, 36189, 7315, 29608, 128115, 3496, 64590, 143079, 83919, 5586, 13209, 2833, 235339, 61621, 164349, 2668, 84574, 1140, 47335, 108079, 7978, 181366, 146140, 2616, 165864, 86100, 11455, 8925, 23191, 197938, 28194, 229309, 196236, 274186
Offset: 1

Views

Author

Pierre CAMI, Apr 08 2013

Keywords

Comments

conjecture: a(n) exist for all n
t=k*2*(k*2*(k*2*(k*2*p(n)^2-1)^2-1)^2-1)^2-1
s=k*2*(k*2*(k*2*p(n)^2-1)^2-1)^2-1
r=k*2*(k*2*p(n)^2-1)^2-1
q=k*2*p(n)^2-1

Links

Crossrefs

Cf. A224489, A224490, A224491.

Programs

  • Mathematica
    a[n_] := For[k = 1, True, k++, p = Prime[n]; If[PrimeQ[q = k*2*p^2 - 1] && PrimeQ[r = k*2*q^2 - 1] && PrimeQ[s = k*2*r^2 - 1] && PrimeQ[k*2*s^2 - 1], Return[k]]]; Table[Print[an = a[n]]; an, {n, 1, 34}] (* Jean-François Alcover, Apr 12 2013 *)

Extensions

Typo in name fixed by Zak Seidov, Apr 11 2013

A224494 Smallest k such that k*2*p(n)^2+1=q is prime and k*2*q^2+1 is also prime.

Original entry on oeis.org

5, 2, 29, 41, 9, 2, 71, 30, 32, 6, 35, 11, 6, 50, 2, 20, 9, 120, 56, 21, 9, 75, 90, 51, 51, 29, 107, 9, 74, 155, 116, 11, 29, 86, 116, 35, 200, 12, 11, 39, 9, 105, 51, 422, 36, 65, 6, 32, 27, 44, 9, 41, 14, 116, 266, 41, 29, 5, 50, 95, 27, 71, 69, 330, 21, 194
Offset: 1

Views

Author

Pierre CAMI, Apr 08 2013

Keywords

Links

Crossrefs

Cf. A224489, A224490, A224491, A224492, A224493, A224495, A224496.

Programs

  • Mathematica
    a[n_] := For[k = 1, True, k++, p = Prime[n]; If[PrimeQ[q = k*2*p^2 + 1] && PrimeQ[k*2*q^2 + 1], Return[k]]]; Table[ a[n] , {n, 1, 66}] (* Jean-François Alcover, Apr 12 2013 *)

A224496 Smallest k such that k*2*p(n)^2+1=q is prime, k*2*q^2+1=r, k*2*r^2+1=s, k*2*r^2+1=t, r, s, and t are also prime.

Original entry on oeis.org

386, 2769, 96656, 5366, 420, 34454, 65039, 192215, 458367, 24735, 27155, 777, 736254, 80297, 279927, 113429, 650474, 238919, 8229, 1284345, 642789, 333141, 11510, 1009271, 932, 395126, 1202174, 25811, 204534, 16286, 22094, 2661131, 22530, 128225, 56225, 900
Offset: 1

Views

Author

Pierre CAMI, Apr 08 2013

Keywords

Comments

Conjecture: a(n) exist for all n
t=k*2*(k*2*(k*2*(k*2*p(n)^2+1)^2+1)^2+1)^2+1
s=k*2*(k*2*(k*2*p(n)^2+1)^2+1)^2+1
r=k*2*(k*2*p(n)^2+1)^2+1
q=k*2*p(n)^2+1

Links

Crossrefs

Cf. A224489, A224490, A224491, A224492, A224193, A224494, A224495.

Programs

  • Mathematica
    a[n_] := For[k = 1, True, k++, p = Prime[n]; If[PrimeQ[q = k*2*p^2 + 1] && PrimeQ[r = k*2*q^2 + 1] && PrimeQ[s = k*2*r^2 + 1] && PrimeQ[k*2*s^2 + 1], Return[k]]]; Table[ Print[an = a[n]]; an , {n, 1, 36}] (* Jean-François Alcover, Apr 12 2013 *)

A224611 Smallest j such that j*2*p(n)^3-1=q is prime, j*2*p(n)*q^2-1=r, j*2*p(n)*r^2-1=s, where r and s are also prime.

Original entry on oeis.org

902, 145, 771, 1060, 3569, 520, 938, 294, 2457, 3911, 1650, 483, 8604, 3450, 2345, 548, 25004, 1635, 5767, 14519, 2518, 6394, 198, 7961, 4272, 8370, 4146, 654, 4489, 6987, 222, 5426, 5250, 17670, 7691, 360, 3994, 20821, 9008, 6525, 9204, 1464, 6111, 6625, 11229, 3315, 62340, 735, 6962, 5236
Offset: 1

Views

Author

Pierre CAMI, Apr 12 2013

Keywords

Links

Crossrefs

Cf. A224491, A224609, A224610, A224612.

Programs

  • Mathematica
    a[n_] := For[j = 1, j < 10^7, j++, p = Prime[n]; If[PrimeQ[q = j*2*p^3 - 1] && PrimeQ[r = j*2*p*q^2 - 1] && PrimeQ[j*2*p*r^2 - 1], Return[j]]]; Table[ Print[an = a[n]]; an, {n, 1, 50}] (* Jean-François Alcover, Apr 12 2013 *)

A224493 Smallest k such that k*2*p(n)^2+1 is prime.

Original entry on oeis.org

2, 1, 2, 2, 3, 2, 6, 15, 12, 6, 8, 2, 5, 6, 2, 14, 3, 23, 2, 5, 2, 3, 5, 3, 6, 11, 2, 9, 3, 5, 6, 3, 14, 8, 5, 6, 2, 2, 5, 9, 8, 11, 3, 2, 11, 3, 6, 5, 6, 5, 2, 5, 3, 8, 15, 14, 3, 5, 20, 5, 6, 14, 14, 8, 5, 2, 8, 2, 6, 18, 14, 3, 6, 9, 5, 12, 3, 9, 15, 18, 6, 6, 3
Offset: 1

Views

Author

Pierre CAMI, Apr 08 2013

Keywords

Links

Crossrefs

Cf. A224489, A224490, A224491, A224492, A224494, A224495, A224496.

Programs

  • Mathematica
    a[n_] := For[k = 1, True, k++, p = Prime[n]; If[PrimeQ[k*2*p^2 + 1], Return[k]]]; Table[ a[n] , {n, 1, 83}] (* Jean-François Alcover, Apr 12 2013 *)
sk[n_]:=Module[{k=1},While[!PrimeQ[2*k*n^2+1],k++];k]; Table[sk[n],{n,Prime[ Range[ 90]]}] (* Harvey P. Dale, Sep 22 2019 *)
Showing 1-7 of 7 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.