Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152871
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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 +0
2
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; listen)
OFFSET

1,1

COMMENT

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: A059646 A003629 A001122 this_sequence A156221 A078971 A129096

Adjacent sequences: A152868 A152869 A152870 this_sequence A152872 A152873 A152874

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research