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

%I

%S 1,2,3,2,3,3,4

%N 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.

%C Is it true for all n : n = p(i)+ p(j)-p(k) ?

%F 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

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

%Y Cf. A000040, A038134.

%K easy,nonn,uned

%O 3,2

%A _Ctibor O. Zizka_, Apr 19 2008

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 March 24 01:20 EDT 2019. Contains 321444 sequences. (Running on oeis4.)