This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A153401 a(n) is the least positive number such that in the representation of 2n+1, n>=4, as a sum of the form (2A000695(k)+a(n))+2(2A000695(l)+a(n)), both of numbers 2A000695(k)+a(n) and 2A000695(l)+a(n) are primes 0
 1, 3, 3, 3, 1, 3, 3, 3, 1, 3, 3, 3, 1, 3, 3, 3, 7, 3, 9, 1, 1, 5, 3, 7, 9, 3, 7, 1, 1, 19, 3, 0, 5, 7, 3, 3, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 4,2 COMMENTS For a given c>=3, every odd N>=3c is a unique sum of the form (2A000695(k)+c) +2(2A000695(l)+c). LINKS CROSSREFS Sequence in context: A172364 A140366 A167817 * A181520 A123073 A059289 Adjacent sequences:  A153398 A153399 A153400 * A153402 A153403 A153404 KEYWORD nonn AUTHOR Vladimir Shevelev, Dec 25 2008 STATUS approved

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 May 22 10:29 EDT 2013. Contains 225519 sequences.