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

A098855 Numbers k such that 4^k + 2^k - 1 is prime.

Original entry on oeis.org

1, 2, 3, 4, 6, 10, 16, 24, 26, 35, 52, 55, 95, 144, 379, 484, 939, 1284, 1300, 2651, 3644, 3979, 7179, 8304, 14840, 32040, 38906, 47759, 51371, 52484, 54016, 57279
Offset: 1

Views

Author

Pierre CAMI, Oct 11 2004

Keywords

Comments

Or, numbers k such that (2^k+1)*2^k - 1 is prime.

Examples

			1300 is in the sequence because 4^1300+2^1300-1 is prime.
4^1+2^1-1 = 5 prime so a(1)=1.
4^2+2^2-1 = 19 prime so a(2)=2.
4^3+2^3-1 = 71 prime so a(3)=3.
4^4+2^4-1 = 271 prime so a(4)=4.
		

Crossrefs

Programs

Formula

A110082(n) = 2^(a(n)-1)*(4^a(n)+2^a(n)-1).

Extensions

Corrected by Torin Huzil (thuzil(AT)gmail.com), Sep 15 2005
More terms from Pierre CAMI, May 10 2012
a(27), a(29)-a(31) inserted by Michael S. Branicky, Jan 02 2025

A110082 Numbers of the form 2^(m-1)*(4^m+2^m-1) where 4^m+2^m-1 is prime.

Original entry on oeis.org

5, 38, 284, 2168, 133088, 537394688, 140739635806208, 2361183382172302573568, 151115729703628426969088, 20282409604241966234288777068544, 45671926166590726335069952848216804538059849728
Offset: 1

Views

Author

Farideh Firoozbakht, Aug 03 2005

Keywords

Comments

This sequence is a subsequence of A110079 namely, if n is in the sequence then sigma(n)=2n-2^d(n) where d(n) is number of positive divisors of n(see comments line of the sequence A110079). Sequence A110080 gives numbers n such that 4^n+2^n-1 is prime.

Examples

			2^1299*(4^1300+2^1300-1) is in the sequence because 4^1300+2^1300-1 is prime.
		

Crossrefs

Programs

  • Mathematica
    Do[If[PrimeQ[4^m+2^m-1], Print[2^(m-1)*(4^m+2^m-1)]], {m, 52}]
Showing 1-2 of 2 results.