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.

Previous Showing 21-26 of 26 results.

A236530 Numbers n such that (48^n + 1)/49 is prime.

Original entry on oeis.org

5, 17, 131, 84589
Offset: 1

Views

Author

Robert Price, Jan 27 2014

Keywords

Comments

All terms are primes.
a(5) > 10^5.

Crossrefs

Programs

  • Mathematica
    Do[ p=Prime[n]; If[ PrimeQ[ (48^p + 1)/49 ], Print[p] ], {n, 1, 9592} ]
  • PARI
    is(n)=ispseudoprime((48^n+1)/49) \\ Charles R Greathouse IV, Jun 13 2017

Extensions

Incorrect first term deleted by Robert Price, Feb 21 2014

A309358 Numbers k such that 10^k + 1 is a semiprime.

Original entry on oeis.org

4, 5, 6, 7, 8, 19, 31, 53, 67, 293, 586, 641, 922, 2137, 3011
Offset: 1

Views

Author

Hugo Pfoertner, Jul 29 2019

Keywords

Comments

a(16) > 12000.
10^k + 1 is composite unless k is a power of 2, and it can be conjectured that it is composite for all k > 2, cf. A038371 and A185121. - M. F. Hasler, Jul 30 2019
Suppose k is odd. Then k is a term if and only if (10^k+1)/11 is prime. - Chai Wah Wu, Jul 31 2019

Examples

			a(1) = 4 because 10^4 + 1 = 10001 = 73*137.
		

Crossrefs

Odd terms in sequence: A001562.

Programs

  • Magma
    IsSemiprime:=func; [n: n in [2..200] | IsSemiprime(s) where s is 10^n+1]; // Vincenzo Librandi, Jul 31 2019
  • Mathematica
    Select[Range[200], Plus@@Last/@FactorInteger[10^# + 1] == 2 &] (* Vincenzo Librandi, Jul 31 2019 *)

A216531 Numbers n such that (10^n + 1)/11 is prime and can be written in the form a^2 + 7*b^2.

Original entry on oeis.org

7, 19, 31, 67, 2137, 268207
Offset: 1

Author

V. Raman, Sep 08 2012

Keywords

Comments

These exponents are congruent to {0, 1, 3} mod 6.

Crossrefs

Cf. A001562.

A216533 Numbers n such that (10^n + 1)/11 is prime, but cannot be written in the form a^2 + 7*b^2.

Original entry on oeis.org

5, 53, 293, 641, 3011
Offset: 1

Author

V. Raman, Sep 08 2012

Keywords

Comments

These exponents are congruent to {2, 4, 5} mod 6.

Crossrefs

Cf. A001562.

A294396 Numbers k such that 12*10^k + 1 is prime.

Original entry on oeis.org

0, 2, 38, 80, 9230, 25598, 39500
Offset: 1

Author

Patrick A. Thomas, Feb 12 2018

Keywords

Comments

k must be even since 12*10^k + 1 is divisible by 11 if k is odd. - Robert G. Wilson v, Feb 12 2018
a(7) > 27440. - Robert G. Wilson v, Feb 17 2018
a(8) > 10^5. - Jeppe Stig Nielsen, Jan 31 2023

Examples

			13 and 1201 are prime, so 0 and 2 are the initial values.
		

Programs

  • Mathematica
    ParallelMap[ If[ PrimeQ[12*10^# +1], #, Nothing] &, 2 + 6Range@ 4500] (* Robert G. Wilson v, Feb 13 2018 *)
  • PARI
    isok(k) = isprime(12*10^k + 1); \\ Altug Alkan, Mar 04 2018

Extensions

a(5) from Robert G. Wilson v, Feb 12 2018
a(6) from Robert G. Wilson v, Feb 13 2018
a(7) from Jeppe Stig Nielsen, Jan 28 2023

A328660 Numbers k such that (10^k + 7^k)/17 is prime.

Original entry on oeis.org

3, 5, 11, 19, 1259, 1399, 2539, 2843, 5857, 10589
Offset: 1

Author

Tim Johannes Ohrtmann, Oct 24 2019

Keywords

Comments

All terms are odd primes. Proof: a(n) cannot be even, because (10^(2*k) + 7^(2*k))/17 is not an integer. If odd number k = x*y, then (10^x + 7^x) and (10^y + 7^y) are nontrivial factors of (10^(x*y) + 7^(x*y)). In conclusion, a(n) must be odd and prime. - Daniel Suteu, Jan 22 2020
The corresponding primes are 79, 6871, 5998666279, 588905817363845479, ...
a(11) > 60000. - Michael S. Branicky, Jul 11 2024

Crossrefs

Programs

  • Magma
    [p: p in PrimesUpTo(1000) | IsPrime((10^p+7^p) div 17)]; // Modified by Jinyuan Wang, Jan 22 2020
  • Mathematica
    Select[Table[Prime[n], {n, 500}], PrimeQ[(10^#+7^#)/17] &] (* Modified by Jinyuan Wang, Jan 22 2020 *)
  • PARI
    forprime(k=3, 10000, if(isprime((10^k+7^k)/17), print1(k, ", ")))
    
Previous Showing 21-26 of 26 results.