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 A138992 #13 Jan 27 2023 17:11:41
%S A138992 1,4,9,16,31,41,64,63,102,143,169,216,203,264,304,381,470,502,538,562,
%T A138992 592,638,769,989,1360,1008,929,961,995,1051,1530,1582,1777,1694,2084,
%U A138992 2140,2369,2288,2527,2778,3399,2721,2859,2698,2756,3035,3613,5800,4765
%N A138992 a(n) = Frobenius number for 6 successive primes = F[p(n), p(n+1), p(n+2), p(n+3), p(n+4), p(n+5)].
%e A138992 a(4)=16 because 16 is the largest number k such that equation 7*x_1 + 11*x_2 + 13*x_3 + 17*x_4 + 19*x_5 + 23*x_6 = k has no solution for any nonnegative x_i (in other words, for every k > 16 there exist one or more solutions).
%t A138992 Table[FrobeniusNumber[{Prime[n],Prime[n + 1], Prime[n + 2], Prime[n + 3], Prime[n + 4], Prime[n + 5]}], {n, 1, 100}]
%t A138992 FrobeniusNumber/@Partition[Prime[Range[100]],6,1] (* _Harvey P. Dale_, Aug 15 2014 *)
%Y A138992 Frobenius numbers for k successive primes: A037165 (k=2), A138989 (k=3), A138990 (k=4), A138991 (k=5), this sequence (k=6), A138993 (k=7), A138994 (k=8).
%Y A138992 Cf. A028387, A079326, A138985, A138986, A138987, A138988.
%K A138992 nonn
%O A138992 1,2
%A A138992 _Artur Jasinski_, Apr 05 2008