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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047949 a(2) = a(3) = 0; for n >= 4, a(n) = largest m such that n-m and n+m are both primes, or -1 if no such m exists. 2
0, 0, 1, 2, 1, 4, 5, 4, 7, 8, 7, 10, 9, 8, 13, 14, 13, 12, 17, 16, 19, 20, 19, 22, 21, 20, 25, 24, 23, 28, 29, 28, 27, 32, 31, 34, 35, 34, 33, 38, 37, 40, 39, 38, 43, 42, 41, 30, 47, 46, 49, 50, 49, 52, 53, 52, 55, 54, 53, 48, 51, 50, 45, 62, 61, 64, 63, 62, 67, 68, 67, 66 (list; graph; refs; listen; history; internal format)
OFFSET

2,4

LINKS

T. D. Noe, Table of n, a(n) for n=2..10000

EXAMPLE

49-30=19 and 49+30=79 are primes, so a(49)=30.

CROSSREFS

Cf. A047160.

Sequence in context: A165050 A165042 A165046 * A197011 A075423 A144774

Adjacent sequences:  A047946 A047947 A047948 * A047950 A047951 A047952

KEYWORD

easy,nice,nonn

AUTHOR

Lior Manor (lior.manor(AT)gmail.com)

EXTENSIONS

Corrected by Harvey P. Dale (hpd1(AT)is2.nyu.edu), Dec 21 2000

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 16 05:39 EST 2012. Contains 205860 sequences.