login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007505 Primes of form 3*2^n -1.
(Formerly M1395)
6
2, 5, 11, 23, 47, 191, 383, 6143, 786431, 51539607551, 824633720831, 26388279066623, 108086391056891903, 55340232221128654847, 226673591177742970257407, 59421121885698253195157962751, 30423614405477505635920876929023 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

a(1) = 2, define f(k) = 2k+1, then a(n+1) = least prime fff...(a(n)). After 383 the next terem is 6143. We have f(383) = 767 (composite), f(767) = 1535 (composite), f(1565)=3071(composite), f(3071) = 6143 (prime), hence the next term is 6143= ffff(383). - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 13 2005

If n is in the sequence and m=(n+1)/3 then m is a solution of the equation, sigma(x+sigma(x))=3x (*). Is it true that there is no other solution of (*)? - Farideh Firoozbakht (mymontain(AT)yahoo.com), Dec 05 2005

REFERENCES

H. Riesel, ``Prime numbers and computer methods for factorization,'' Progress in Mathematics, Vol. 57, Birkhauser, Boston, 1985, Chap. 4, see pp. 381-384.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Wilfrid Keller, List of primes k.2^n - 1 for k < 300

Eric Weisstein's World of Mathematics, Thabit ibn Kurrah Number

Index entries for sequences of n such that k*2^n-1 (or k*2^n+1) is prime

CROSSREFS

See A002235 for more terms.

Sequence in context: A105120 A084403 A055011 * A059411 A126017 A034468

Adjacent sequences:  A007502 A007503 A007504 * A007506 A007507 A007508

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 23 04:26 EST 2012. Contains 206606 sequences.