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 A003368 #23 Aug 06 2020 22:07:11
%S A003368 12,75,138,201,264,327,390,453,516,579,642,705,740,768,803,866,929,
%T A003368 992,1055,1118,1181,1244,1307,1370,1433,1468,1531,1594,1657,1720,1783,
%U A003368 1846,1909,1972,2035,2098,2196,2259,2322,2385,2448,2511,2574,2637,2700,2763,2924,2987
%N A003368 Numbers that are the sum of 12 positive 6th powers.
%H A003368 David A. Corneth, <a href="/A003368/b003368.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from T. D. Noe)
%e A003368 From _David A. Corneth_, Aug 03 2020: (Start)
%e A003368 54710 is in the sequence as 54710 = 2^6 + 3^6 + 3^6 + 3^6 + 3^6 + 4^6 + 4^6 + 4^6 + 4^6 + 4^6 + 5^6 + 5^6.
%e A003368 94302 is in the sequence as 94302 = 1^6 + 1^6 + 1^6 + 1^6 + 1^6 + 2^6 + 2^6 + 2^6 + 2^6 + 3^6 + 6^6 + 6^6.
%e A003368 133585 is in the sequence as 133585 = 1^6 + 1^6 + 1^6 + 3^6 + 3^6 + 3^6 + 3^6 + 3^6 + 4^6 + 4^6 + 4^6 + 7^6. (End)
%t A003368 Module[{upto=2200,r},r=Ceiling[Surd[upto,6]];Select[Union[Total/@ Tuples[ Range[r]^6,12]],#<=upto&]] (* _Harvey P. Dale_, Aug 25 2015 *)
%o A003368 (PARI) (A003368_upto(N, k=12, m=6)=[n|n<-[1..#N=sum(n=1, sqrtnint(N, m), 'x^n^m, O('x^N))^k], polcoef(N, n)])(3000) \\ 2nd & 3rd optional arg allow to get other sequences of this group. See A003333 for alternate code. - _M. F. Hasler_, Aug 03 2020
%Y A003368 Cf. A001014 (sixth powers).
%Y A003368 Cf. A003358 - A003367 (numbers that are the sum of 2, ..., 11 positive 6th powers); A003335, A003346, A003357, A003379, A003390, A004801, A004812, A004823 (numbers that are the sum of 12 positive 3rd, ..., 11th powers).
%K A003368 nonn,easy
%O A003368 1,1
%A A003368 _N. J. A. Sloane_