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 A138989 #20 Jun 09 2025 00:53:00
%S A138989 1,4,13,30,53,80,117,131,194,286,293,520,613,522,1310,858,1001,929,
%T A138989 1610,1418,1322,1499,1421,2941,3300,3533,3710,3957,2065,2241,3685,
%U A138989 4595,3697,3930,5956,12074,5509,5874,14690,7968,6084,6373,12413,12740,6694,21878
%N A138989 a(n) = Frobenius number for 3 successive primes = F[p(n), p(n+1), p(n+2)].
%e A138989 a(3)=13 because 13 is the largest number k such that the equation 5*x_1 + 7*x_2 + 11*x_3 = k has no solution for any nonnegative x_i. (In other words, for every k > 13 there exist one or more solutions.)
%t A138989 Table[FrobeniusNumber[{Prime[n],Prime[n + 1], Prime[n + 2]}], {n, 1, 100}]
%t A138989 FrobeniusNumber/@Partition[Prime[Range[50]],3,1] (* _Harvey P. Dale_, Dec 01 2015 *)
%Y A138989 Frobenius numbers for k successive primes: A037165 (k=2), this sequence (k=3), A138990 (k=4), A138991 (k=5), A138992 (k=6), A138993 (k=7), A138994 (k=8).
%Y A138989 Cf. A028387, A079326, A138985, A138986, A138987, A138988.
%K A138989 nonn
%O A138989 1,2
%A A138989 _Artur Jasinski_, Apr 05 2008