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

A238797 Smallest k such that 2^k - (2*n+1) and (2*n+1)*2^k - 1 are both prime, k <= 2*n+1, or 0 if no such k exists.

Original entry on oeis.org

0, 3, 4, 0, 0, 0, 0, 5, 6, 5, 7, 6, 9, 5, 0, 7, 6, 6, 0, 0, 10, 0, 6, 0, 7, 9, 6, 7, 8, 0, 17, 8, 0, 0, 7, 0, 0, 18, 0, 0, 0, 8, 0, 10, 8, 9, 18, 0, 0, 7, 0, 0, 8, 12, 0, 7, 0, 11, 16, 0, 21, 0, 0, 0, 8, 14, 0, 0, 18, 9, 10, 8, 77, 0, 0, 0, 12, 8, 0, 11, 18, 0
Offset: 0

Views

Author

Keywords

Comments

Numbers n such that 2^k - (2*n+1) and (2*n+1)*2^k - 1 are both prime:
For k = 0: 2, 3, 5, 7, 13, 17, ... Intersection of A000043 and A000043
for k = 1: 3, 4, 6, 94, ... Intersection of A050414 and A002235
for k = 2: 4, 8, 10, 12, 18, 32, ... Intersection of A059608 and A001770
for k = 3: Intersection of A059609 and A001771
for k = 4: 21, ... Intersection of A059610 and A002236
for k = 5: Intersection of A096817 and A001772
for k = 6: Intersection of A096818 and A001773
for k = 7: 5, 10, 14, ... Intersection of A059612 and A002237
for k = 8: 6, 16, 20, 36, ... Intersection of A059611 and A001774
for k = 9: 5, 21, ... Intersection of A096819 and A001775
for k = 10: 7, 13, ... Intersection of A096820 and A002238
for k = 11: 6, 8, 12, ...
for k = 12: 9, ...
for k = 13: 5, 8, 10, ...

Examples

			a(1) = 3 because 2^3 - (2*1+1) = 5 and (2*1+1)*2^3 - 1 = 23 are both prime, 3 = 2*1+1,
a(2) = 4 because 2^4 - (2*2+1) = 11 and (2*2+1)*2^4 - 1 = 79 are both prime, 4 < 2*2+1 = 5.
		

Crossrefs

Cf. A238748, A238904 (smallest k such that 2^k + (2n+1) and (2n+1)*2^k + 1 are both prime, k <= n, or -1 if no such k exists).

Programs

  • Mathematica
    a[n_] := Catch@ Block[{k = 1}, While[k <= 2*n+1, If[2^k - (2*n + 1) > 0 && PrimeQ[2^k - (2*n+1)] && PrimeQ[(2*n + 1)*2^k-1], Throw@k]; k++]; 0]; a/@ Range[0, 80] (* Giovanni Resta, Mar 15 2014 *)

Extensions

a(0), a(19), a(20) corrected by Giovanni Resta, Mar 13 2014

A330413 Integers m such that sigma(m) + sigma(16*m) = 34*m.

Original entry on oeis.org

268, 4336, 69568, 73014378496, 18691696623616, 80280230208715249156096, 5516815412193254337299253840314368, 22596875928343569838211798520159010816, 106710729501573572985208420194451100911225778218295042768896, 7689318425915528602346510723233181380859942271270135051778769275060995751936
Offset: 1

Views

Author

Jinyuan Wang, Feb 12 2020

Keywords

Comments

This is the case h = 16 of the h-perfect numbers as defined in the Harborth link.

Examples

			268 is a term since sigma(268) + sigma(16*268) = 9112, that is 34*268.
		

Crossrefs

Programs

  • PARI
    isok(m) = sigma(m) + sigma(16*m) == 34*m;

Formula

a(n) = 2^A001774(n) * (17*2^A001774(n) - 1).

A238749 Exponents of third Mersenne prime pair: numbers n such that 2^n - 5 and 5*2^n - 1 are both prime.

Original entry on oeis.org

4, 8, 10, 12, 18, 32
Offset: 1

Views

Author

Keywords

Comments

a(7) > 350028.
Intersection of A059608 and A001770.
Exponents of Mersenne prime pairs {2^n - (2k + 1), (2k + 1)*2^n - 1}:
for k = 0: 2, 3, 5, 7, 13, 17, ... Intersection of A000043 and A000043
for k = 1: 3, 4, 6, 94, ... Intersection of A050414 and A002235
for k = 2: 4, 8, 10, 12, 18, 32, ... Intersection of A059608 and A001770
for k = 3: Intersection of A059609 and A001771
for k = 4: 21, ... Intersection of A059610 and A002236
for k = 5: Intersection of A096817 and A001772
for k = 6: Intersection of A096818 and A001773
for k = 7: 5, 10, 14, ... Intersection of A059612 and A002237
for k = 8: 6, 16, 20, 36, ... Intersection of A059611 and A001774
for k = 9: 5, 21, ... Intersection of A096819 and A001775
for k = 10: 7, 13, ... Intersection of A096820 and A002238
for k = 11: 6, 8, 12, ...
for k = 12: 9, ...
for k = 13: 5, 8, 10, ...
for k = 14:

Examples

			a(1) = 4 because 2^4 - 5 = 11 and 5*2^4 - 1 = 79 are both primes.
		

Crossrefs

Programs

  • Magma
    [n: n in [0..100] | IsPrime(2^n-5) and IsPrime(5*2^n-1)]; // Vincenzo Librandi, May 17 2015
  • Mathematica
    fQ[n_] := PrimeQ[2^n - 5] && PrimeQ[5*2^n - 1]; k = 1; While[ k < 15001, If[fQ@ k, Print@ k]; k++] (* Robert G. Wilson v, Mar 05 2014 *)
    Select[Range[1000], PrimeQ[2^# - 5] && PrimeQ[5 2^# - 1] &] (* Vincenzo Librandi, May 17 2015 *)
  • PARI
    isok(n) = isprime(2^n - 5) && isprime(5*2^n - 1); \\ Michel Marcus, Mar 04 2014
    
Showing 1-3 of 3 results.