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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137467 For n >=3, n = p(i)+p(j)-p(k), p(i),p(j),p(k) distinct primes and i+j-k=minimum. Then a(n) = i + j - k. 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

Table of n, a(n) for n=3..9.

FORMULA

For n >=3, n = p(i)+p(j)-p(k), p(i),p(j),p(k) distinct primes and i+j-k=minimum. Then a(n) = i + j - k

EXAMPLE

n=6; 6=p(1)+p(5)-p(4) =2+11-7; a(6)= 1+5-4 = 2

CROSSREFS

Cf. A000040, A038134.

Sequence in context: A078173 A248005 A129759 * A261461 A078627 A106370

Adjacent sequences:  A137464 A137465 A137466 * A137468 A137469 A137470

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 19 12:53 EST 2019. Contains 320310 sequences. (Running on oeis4.)