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.

A182354 Primes of the form n*2^n + 3.

Original entry on oeis.org

3, 5, 11, 67, 163, 10243, 22531, 7516192771, 43980465111043, 142788163609707759784588649053552643, 2637188343637273091841153207596203638787
Offset: 1

Views

Author

Patrick Devlin, Apr 25 2012

Keywords

Comments

These are similar to the Woodall primes, A050918, which are primes of the form n*2^n - 1.

Examples

			3 = 0*2^0 + 3; 5 = 1*2^1 + 3; 11 = 2*2^2 + 3; 67 = 4*2^4 + 3
		

Crossrefs

Programs

  • Maple
    #choose N large, then S is the desired set
    f:=n->n*2^n + 3:
    S:={}:
    for n from 0 to N do if(isprime(f(n))) then S:=S union {f(n)}: fi: od

A182342 Primes of the form n*2^n + 5.

Original entry on oeis.org

5, 7, 13, 29, 389, 2053, 49157, 106501, 402653189, 1744830469, 2473901162501, 184717953466373, 774056185954309, 31057439705591620336669228531717, 70745044697537026438728012485623813
Offset: 1

Views

Author

Patrick Devlin, Apr 25 2012

Keywords

Comments

These are similar to the Woodall primes, A050918, which are primes of the form n*2^n - 1.

Examples

			5 = 0*2^0 + 5; 7 = 1*2^1 + 5; 13 = 2*2^2 + 5; 29 = 3*2^3 + 5; 389 = 6*2^6 + 5
		

Crossrefs

Programs

  • Maple
    #choose N large, then S is the desired set
    f:=n->n*2^n + 5:
    S:={}:
    for n from 0 to N do if(isprime(f(n))) then S:=S union {f(n)}: fi: od
Showing 1-2 of 2 results.