login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137467 a(n) = i + j - k, where n = p(i) + p(j) - p(k), such that p(i), p(j), and p(k) are distinct primes, i + j - k = minimum, and n >= 3. 0
1, 2, 3, 2, 3, 3, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,2
COMMENTS
Is it true for all n : n = p(i) + p(j) - p(k)?
LINKS
EXAMPLE
For n = 6, 6 = p(1) + p(5) - p(4) = 2 + 11 - 7; so a(6) = 1 + 5 - 4 = 2.
CROSSREFS
Sequence in context: A078173 A248005 A129759 * A261461 A078627 A106370
KEYWORD
easy,nonn,uned
AUTHOR
Ctibor O. Zizka, Apr 19 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 16:08 EDT 2024. Contains 371794 sequences. (Running on oeis4.)