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.

A348659 Numbers whose numerator and denominator of the harmonic mean of their divisors are both prime numbers.

Original entry on oeis.org

3, 5, 13, 14, 15, 37, 42, 61, 66, 73, 92, 114, 157, 182, 193, 258, 277, 308, 313, 397, 402, 421, 457, 476, 477, 541, 546, 570, 613, 661, 673, 733, 744, 757, 812, 877, 978, 997, 1093, 1148, 1153, 1201, 1213, 1237, 1266, 1278, 1321, 1381, 1428, 1453, 1621, 1657
Offset: 1

Views

Author

Amiram Eldar, Oct 28 2021

Keywords

Comments

The prime terms of this sequence are the primes p such that (p+1)/2 is also a prime (A005383).
If p is in A109835, then p*(2*p-1) is a semiprime term.

Examples

			3 is a term since the harmonic mean of its divisors is 3/2 and both 2 and 3 are primes.
		

Crossrefs

Similar sequences: A023194, A048968, A074266, A348659.

Programs

  • Mathematica
    q[n_] := Module[{h = DivisorSigma[0, n]/DivisorSigma[-1, n]}, And @@ PrimeQ[{Numerator[h], Denominator[h]}]]; Select[Range[2000], q]

A109927 First primes p connected to two primes either by 2p+1 or 2p-1 upward [downward (p-1)/2 or (p+1)/2].

Original entry on oeis.org

3, 5, 11, 23, 37, 83, 157, 179, 359, 661, 719, 877, 997, 1019, 1237, 1439, 1657, 2039, 2063, 2137, 2459, 2557, 2819, 2903, 2963, 3023, 3061, 3623, 3779, 3803, 3863, 4177, 4261, 4357, 4621, 4919, 5399, 5581, 5639, 6037, 6121, 6217, 6361, 6899, 6983, 7079
Offset: 1

Views

Author

Alexandre Wajnberg, Aug 31 2005

Keywords

Comments

These primes may be part of Cunningham chains longer than three terms. It seems the two operators are never mixed, except for 3, 5 and 7: -for 3, we have: 2 through <2p-1> -> 3 through <2p+1> -> 7 -for 5: 3 <2p-1> -> 5 <2p+1> -> 11 -for 7: 3 <2p+1> -> 7 <2p-1> -> 13
For p > 7, such a mixed chain with p in the middle is impossible because the number 3 would be a nontrivial factor of either the smallest or the largest term. - Jeppe Stig Nielsen, May 05 2019
Primes (excluding 2 and 7) that divide more than one semiprime triangular number A068443. - Jeppe Stig Nielsen, May 05 2019
The disjoint union of A059455 and A109835. - Jeppe Stig Nielsen, May 05 2019

Examples

			a(3)=11 is here because 5->11->23 through <2p+1>;
a(4)=23 because 11->23->47 through <2p+1>;
a(5)=37 because 19->37->73 through <2p-1>.
		

Crossrefs

Programs

  • PARI
    forprime(p=3,10^6,if(p%3==2,isprime((p-1)/2)&&isprime(2*p+1),isprime((p+1)/2)&&isprime(2*p-1))&&print1(p,", ")) \\ Jeppe Stig Nielsen, May 05 2019

A110089 Smallest prime beginning (through <*2+1> or/and <*2-1>) a complete Cunningham chain (of the first or the second kind) of length n.

Original entry on oeis.org

11, 3, 2, 509, 2, 89, 16651, 15514861, 85864769, 26089808579, 665043081119, 554688278429, 758083947856951, 95405042230542329, 69257563144280941
Offset: 1

Views

Author

Alexandre Wajnberg, Sep 04 2005

Keywords

Comments

The word "complete" indicates each chain is exactly n primes long for the operator in function (i.e. the chain cannot be a subchain of another one); and the first and/or last term may be involved in a chain of the other kind (i.e. the chain may be connected to another one). a(1)-a(8) computed by Gilles Sadowski.

Examples

			a(1)=11 because 2, 3, 5 and 7 are included in longer chains than one prime long; and 11 (although included in a <2p+1> chain) has no prime connection through <2p-1>.
a(2)=3 because 3 begins (through 2p+1>) the first complete two primes chain: 3-> 7 (even if 3 and 7 are also part of two others chains, but through <2p-1>).
a(3)=2 because (although 2 begins also a five primes chain through <2p+1>) it begins, through <2p-1>, the first complete three primes chain encountered: 2->3->5.
		

Crossrefs

Formula

a(n) = min(A005602(n), A005603(n)). - R. J. Mathar, Jul 23 2008

Extensions

a(8)-a(13) via A005602, A005603 from R. J. Mathar, Jul 23 2008
a(14)-a(15) via A005602, A005603 from Jason Yuen, Sep 03 2024

A110092 Smallest prime ending (through <*2+1> or <*2-1> separately) a complete Cunningham chain (of the first or the second kind) of length n.

Original entry on oeis.org

17, 59, 73, 4079, 47, 2879, 1065601
Offset: 1

Views

Author

Alexandre Wajnberg, Sep 04 2005

Keywords

Comments

The word "complete" indicates each chain is exactly n primes long for the operator in function (i.e. the chain cannot be a subchain of another one); and the first and/or last term may not be involved in a chain of the other kind (i.e. the chain may not be connected to another one).

Examples

			a(1)=17 because 2, 3, 5, 7, 11 and 13 are part of longer chains whatever the operator; 17 is the first completely isolated prime.
a(2)=59 because it ends the first two primes chain not connected to another one: 29->59.
		

Crossrefs

Extensions

Terms computed by Gilles Sadowski.

A110093 Smallest prime ending (through <*2+1> or/and <*2-1>) a complete Cunningham chain (of the first or the second kind) of length n.

Original entry on oeis.org

11, 7, 5, 4079, 47, 2879, 1065601
Offset: 1

Views

Author

Alexandre Wajnberg, Sep 04 2005

Keywords

Comments

The word "complete" indicates each chain is exactly n primes long for the operator in function (i.e. the chain cannot be a subchain of another one); but the first and/or last term may be involved in a chain of the other kind (i.e. the chain may be connected to another one).

Examples

			a(1)=11 because 2, 3, 5 and 7 are not ending chains; or are part of chains longer than one prime; 11, although is part of a five primes <2p+1> chain, is isolated through <2p-1>.
a(2)=7 because 7 ends through <2p+1> the first two primes chain: 3->7 (even if both primes are also part of <2p-1> chains).
		

Crossrefs

Extensions

Terms computed by Gilles Sadowski.
Showing 1-5 of 5 results.