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

A123998 Numbers k such that 2k+1 and 4k+1 are primes.

Original entry on oeis.org

1, 3, 9, 15, 18, 39, 48, 69, 78, 99, 105, 114, 135, 153, 165, 168, 183, 189, 219, 249, 273, 288, 300, 303, 309, 330, 345, 363, 405, 414, 438, 468, 483, 498, 504, 534, 585, 618, 639, 648, 699, 714, 729, 765, 804, 813, 828, 879, 933, 1005, 1014, 1044, 1065, 1068
Offset: 1

Views

Author

Artur Jasinski, Oct 31 2006

Keywords

Comments

Note that if n == 1 (mod 3) then 2n+1 is not prime (except n=1); and if n == 2 (mod 3) then 4n+1 is not prime. Therefore n must be a multiple of 3, except for n=1. - Max Alekseyev, Nov 02 2006

Crossrefs

Programs

  • Magma
    [n: n in [0..1100] |IsPrime(2*n+1) and IsPrime(4*n+1)]; // Vincenzo Librandi, Apr 17 2013
    
  • Mathematica
    Select[Range[1100], And @@ PrimeQ /@ ({2, 4}*# + 1) &] (* Ray Chandler, Nov 20 2006 *)
  • PARI
    is(k) = isprime(2*k+1) && isprime(4*k+1); \\ Jinyuan Wang, Aug 04 2019

Extensions

Extended by Ray Chandler, Nov 20 2006

A124408 Numbers k such that 2k+1, 4k+1 and 6k+1 are primes.

Original entry on oeis.org

1, 3, 18, 105, 135, 153, 165, 168, 300, 363, 585, 618, 648, 765, 828, 1110, 1140, 1278, 1518, 1530, 1533, 2130, 2223, 2400, 2475, 2613, 2790, 2925, 3075, 3180, 3345, 3420, 3483, 3810, 3840, 3843, 3933, 4008, 4083, 4095, 4143, 4260, 4263, 4323, 4470, 4545
Offset: 1

Views

Author

Artur Jasinski, Oct 31 2006

Keywords

Crossrefs

Programs

  • Mathematica
    Select[Range[4600], And @@ PrimeQ /@ ({2, 4, 6}*# + 1) &] (* Ray Chandler, Nov 20 2006 *)
  • PARI
    is(k) = sum(j = 1, 3, isprime(2*j*k+1)) == 3; \\ Jinyuan Wang, Aug 04 2019

A124409 Numbers k such that 2k+1, 4k+1, 6k+1 and 8k+1 are primes.

Original entry on oeis.org

165, 765, 1530, 2130, 2475, 3420, 5415, 7695, 9060, 11505, 12705, 13020, 15885, 16650, 20055, 20745, 22530, 24915, 26940, 29670, 32925, 35070, 36885, 39270, 44370, 47730, 48465, 54735, 55860, 56310, 58860, 65655, 66600, 67365, 67650
Offset: 1

Views

Author

Artur Jasinski, Oct 31 2006

Keywords

Crossrefs

Programs

  • Mathematica
    Select[Range[68000], And @@ PrimeQ /@ ({2, 4, 6, 8}*# + 1) &] (* Ray Chandler, Nov 20 2006 *)
  • PARI
    is(k) = sum(j = 1, 4, isprime(2*j*k+1)) == 4; \\ Jinyuan Wang, Aug 04 2019

A124411 Numbers k such that 2k+1, 4k+1, 6k+1, 8k+1, 10k+1 and 12k+1 are primes.

Original entry on oeis.org

12705, 13020, 105525, 256410, 966840, 1707510, 1944495, 2310000, 2478630, 3132675, 3836070, 3976770, 4112430, 4532325, 5499585, 5920005, 6610485, 7390845, 8552250, 10739505, 11120340, 12231450, 12338130, 13243230, 16467255
Offset: 1

Views

Author

Artur Jasinski, Oct 31 2006

Keywords

Crossrefs

Programs

  • Mathematica
    Select[Range[10^7], And @@ PrimeQ /@ ({2, 4, 6, 8, 10, 12}*# + 1) &] (* Ray Chandler, Nov 20 2006 *)
  • PARI
    is(k) = sum(j = 1, 6, isprime(2*j*k+1)) == 6; \\ Jinyuan Wang, Aug 04 2019

Extensions

Extended by Ray Chandler, Nov 20 2006

A237190 Numbers k such that k+1, 2k+1, 3k+1, 4k+1, 5k+1 are five primes.

Original entry on oeis.org

10830, 25410, 26040, 88740, 165900, 196560, 211050, 224400, 230280, 247710, 268500, 268920, 375480, 377490, 420330, 451410, 494340, 512820, 592620, 604170, 735750, 751290, 765780, 799170, 808080, 952680, 975660, 1053690, 1064190, 1132860, 1156170, 1532370, 1559580
Offset: 1

Views

Author

Alex Ratushnyak, Feb 04 2014

Keywords

Comments

A subsequence of A237189.
All terms are divisible by 30, and b(n) = a(n)/30 begins: 361, 847, 868, 2958, 5530, 6552, 7035, 7480, 7676, 8257, 8950, 8964, 12516, 12583, 14011, ...

Crossrefs

Programs

  • Mathematica
    Select[30*Range[52000],AllTrue[#*Range[5]+1,PrimeQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Dec 31 2017 *)
  • Python
    from sympy import isprime
    for n in range(2000000):
        if isprime(n+1) and isprime(2*n+1) and isprime(3*n+1) and isprime(4*n+1) and isprime(5*n+1):
            print(n, end=', ')
Showing 1-5 of 5 results.