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.

A082101 Primes of form 2^k + 3^k.

Original entry on oeis.org

2, 5, 13, 97
Offset: 1

Views

Author

Labos Elemer, Apr 14 2003

Keywords

Comments

Next term, if it exists, is > 10^125074. - David Wasserman, Aug 13 2004
Since x+y is a factor of x^m+y^m if m is odd, 2^m+3^m is divisible by 2+3=5 unless m is zero or a power of 2. This is similar to Fermat numbers 1+2^m. - Michael Somos, Aug 27 2004
Checked k being powers of two through 2^21. Thus a(5) > 10^2000000. Primes of this magnitude are rare (about 1 in 4.6 million), so chance of finding one is remote with today's computer algorithms and speeds. - Robert Price, Apr 25 2013
If a(5) exists it is greater than 10^16000000. Probably complete. - Charles R Greathouse IV, Apr 29 2013

Examples

			m=0: 1+1, m=1: 2+3, m=2: 4+9, m=4: 16+81.
		

Crossrefs

Programs