This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A137467 #5 Jun 24 2021 01:47:13 %S A137467 1,2,3,2,3,3,4 %N 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. %C A137467 Is it true for all n : n = p(i) + p(j) - p(k)? %e A137467 For n = 6, 6 = p(1) + p(5) - p(4) = 2 + 11 - 7; so a(6) = 1 + 5 - 4 = 2. %Y A137467 Cf. A000040, A038134. %K A137467 easy,nonn,uned %O A137467 3,2 %A A137467 _Ctibor O. Zizka_, Apr 19 2008