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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136851 a(1)=3 (smallest odd prime); for n>=2, a(n) = smallest prime such that 1) a(n)-a(n-1) = prime if odd, else double of prime and 2) for sum_{ k = 1..n } a(k) = prime if odd, else double of prime. 0
3, 7, 13, 23, 37, 59, 97, 107, 241, 251, 613, 911, 937, 983, 997, 1223, 1381, 1499, 1621, 1979, 2281, 2399, 2521, 2663, 2677, 3299, 3361, 3623, 3637, 3671, 3697, 3803, 3889, 3911, 4273, 4451, 4729, 4787, 4909, 5003, 5821, 5927, 6229, 6791, 6793, 6827, 6829 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

For n = 3 a(3)-a(2) =13-7=6 =2*3 = double of prime, 3+7+13=23 = prime

CROSSREFS

Sequence in context: A058682 A081995 A053599 * A155339 A122886 A154691

Adjacent sequences:  A136848 A136849 A136850 * A136852 A136853 A136854

KEYWORD

easy,nonn

AUTHOR

Philippe Lallouet (philip.lallouet(AT)orange.fr), Apr 03 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 17 09:17 EST 2012. Contains 206009 sequences.