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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152871 On the first step, put a(1)=3; on the Nth step, N>=2, we subtract from 2^(N+1) all the constructed numbers on the preceding steps and include all prime differences into the sequence 1
3, 5, 11, 13, 19, 29, 53, 59, 61, 67, 109, 197, 227, 251, 499, 509, 773, 797, 827, 971, 1013, 1019, 1021, 1549, 1987, 2029, 3083, 3299, 3323, 4091, 4093 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

It is easy to see that primes obtained on different steps are different. Questions: 1)if on every step we obtain at least one prime? 2)if the sequence is infinite?

CROSSREFS

A152451

Sequence in context: A003629 A175865 A001122 * A156221 A179017 A078971

Adjacent sequences:  A152868 A152869 A152870 * A152872 A152873 A152874

KEYWORD

nonn

AUTHOR

Vladimir Shevelev (shevelev(AT)bgu.ac.il), Dec 14 2008

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 14 17:10 EST 2012. Contains 205644 sequences.