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

A066388 Numbers j such that j and 2j are both between a pair of twin primes.

Original entry on oeis.org

6, 30, 660, 810, 2130, 2550, 3330, 3390, 5850, 6270, 10530, 33180, 41610, 44130, 53550, 55440, 57330, 63840, 65100, 70380, 70980, 72270, 74100, 74760, 78780, 80670, 81930, 87540, 93240, 102300, 115470, 124770, 133980, 136950, 156420
Offset: 1

Views

Author

Jud McCranie, Dec 23 2001

Keywords

Comments

Also terms of A014574 such that twice the term is also in A014574. Related to a problem of anti-divisors.
All a(n) > 6 must be a multiple of 30: As for elements of A014574, we must have a(n) = 6k, and k = 5m+-1 would lead to a(n)-+1 divisible by 5, while k = 5m+-2 would lead to 2*a(n)+-1 divisible by 5, so only k=5m is possible. - M. F. Hasler, Nov 27 2010

Examples

			j = 30 is a term since 29 and 31 are prime, as are 59 and 61.
		

Crossrefs

Subsequence of A014574.
Subsequences: A118859, A118860, A349321.

Programs

  • Mathematica
    lst={}; Do[p1=Prime[n]; p2=Prime[n+1]; d=2; If[p2-p1==d, w=p1+1; If[PrimeQ[2*w-1]&&PrimeQ[2*w+1], AppendTo[lst, w]]], {n, 1, 10^4}]; lst (* Vladimir Joseph Stephan Orlovsky, Aug 07 2008 *)
  • PARI
    { n=0; forstep (m=2, 10^9, 2, if (isprime(m - 1) && isprime(m + 1) && isprime(2*m - 1) && isprime(2*m + 1), write("b066388.txt", n++, " ", m); if (n==1000, return)) ) } \\ Harry J. Smith, Feb 13 2010

Formula

A117499(a(n)) = 4. - Reinhard Zumkeller, Mar 23 2006
{k in A014574: 2*k in A014574}. - R. J. Mathar, Jan 20 2025

A118860 Numbers k such that k-1, k+1, 2k-1, 2k+1, 3k-1, 3k+1, 4k-1 and 4k+1 are all primes.

Original entry on oeis.org

21968100, 37674210, 81875220, 356467230, 416172330, 750662640, 1007393730, 1150070040, 1586271960, 1963954650, 3127171320, 3669568560, 4377895410, 4383541050, 5575083360, 5686935870, 5708418870, 7365234450, 7478474430, 7681046100, 8453862690, 8898688680
Offset: 1

Views

Author

Labos Elemer, May 03 2006

Keywords

Comments

All terms are multiples of 210, hence simpler code is possible.

Examples

			21968100 is a term because 21968099, 21968101, 43936199, 43936201, 65904299, 65904301, 87872399, 87872401 are all prime.
		

Crossrefs

Subsequence of A014574, A066388 and A118859.
Subsequence: A349321.

Programs

  • Mathematica
    tb={};Do[If[(PrimeQ[n-1]&&PrimeQ[n+1])&& (PrimeQ[2*n-1]&&PrimeQ[2*n+1])&& (PrimeQ[3*n-1]&&PrimeQ[3*n+1])&& (PrimeQ[4*n-1]&&PrimeQ[4*n+1]), Print[n];AppendTo[tb,n]], {n,21968100,10^8,210}];tb
    Select[210*Range[424*10^5],AllTrue[{#-1,#+1,2#-1,2#+1,3#-1,3#+1,4#-1,4#+1},PrimeQ]&] (* Harvey P. Dale, Jul 23 2024 *)
  • PARI
    isok(k) = if(k % 210, 0, for(i = 1, 4, forstep(j = -1, 1, 2, if(!isprime(i*k-j), return(0)))); 1); \\ Amiram Eldar, Mar 13 2025

Formula

a(n) = 210*A174293(n).

Extensions

Edited by Don Reble, May 16 2006
a(20)-a(22) from Pontus von Brömssen, Oct 14 2021

A118859 Numbers k such that k-1, k+1, 2*k-1, 2*k+1, 3*k-1 and 3*k+1 are primes.

Original entry on oeis.org

6, 53550, 420420, 422310, 1624350, 2130240, 3399900, 5199810, 5246010, 6549270, 7384440, 7775880, 9516570, 9565710, 10430280, 11845260, 13207950, 14562870, 14619990, 18747960, 20099940, 21596820, 21968100, 24358950, 24610740, 26916120, 28359240, 30838080
Offset: 1

Views

Author

Labos Elemer, May 03 2006

Keywords

Examples

			6 is a term because 5, 7, 11, 13, 17, 19 are all prime.
		

Crossrefs

Subsequence of A014574 and A066388.
Subsequences: A118860, A349321.

Programs

  • Mathematica
    Select[Range[25*10^6],AllTrue[Flatten[{#+{1,-1},2#+{1,-1},3#+{1,-1}}], PrimeQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Sep 13 2016 *)
  • PARI
    isok(k) = isprime(k-1) && isprime(k+1) && isprime(2*k-1) && isprime(2*k+1) && isprime(3*k-1) && isprime(3*k+1); \\ Amiram Eldar, Mar 13 2025

Formula

a(n) = 6*A290811(n).

Extensions

Edited by Don Reble, May 16 2006
a(26)-a(28) from Jon E. Schoenfield, Dec 07 2021

A349321 Numbers k such that k-1, k+1, 2k-1, 2k+1, 3k-1, 3k+1, 4k-1, 4k+1, 5k-1, and 5k+1 are all primes.

Original entry on oeis.org

100803789240, 441913177860, 1768738337520, 3906037699410, 5988326187690, 6266477200830, 6905441609220, 6973884137220, 14323608903450, 17683172090430, 20047266723330, 23371434572640, 27904703386560, 29484744885750, 31141493827290, 33202639844220, 34645262968470
Offset: 1

Views

Author

Jon E. Schoenfield, Nov 14 2021

Keywords

Comments

All terms are multiples of 2*3*5*7*11 = 2310.
From Jon E. Schoenfield, Mar 21 2022: (Start)
Each term is congruent to one of only
1 residue modulo 2*3*5*7*11 = 2310 (0.04329%),
3 residues modulo 2*3*5*7*11*13 = 30030 (0.00999%),
21 residues modulo 2*3*5*7*...*17 = 510510 (0.00411%),
189 residues modulo 2*3*5*7*...*19 = 9699690 (0.00195%),
2457 residues modulo 2*3*5*7*...*23 = 223092870 (0.00110%),
46683 residues modulo 2*3*5*7*...*29 = 6469693230 (0.00072%),
980343 residues modulo 2*3*5*7*...*31 = 200560490130 (0.00049%), etc.;
making use of these can allow more efficient searching for terms of the sequence.
The Magma program (see Links) generates a list of the possible residues modulo 2*3*5*7*...*31 and tests only numbers having one of those residues. (Note that the program, when run on the Online Magma Calculator, generates only the first three terms of the sequence before being terminated on reaching the 120-second time limit.) (End)

Crossrefs

Programs

  • PARI
    is_ok(k)=for(j=1,5, if(!isprime(j*k-1), return(0)); if(!isprime(j*k+1), return(0));); return(1); \\ Joerg Arndt, Nov 15 2021
Showing 1-4 of 4 results.