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 A025400 #16 Apr 26 2020 13:05:49
%S A025400 1009,1366,1457,1520,1737,1756,1793,1854,1945,2072,2241,2456,2736,
%T A025400 3060,3592,3599,3745,3926,4105,4131,4168,4229,4320,4376,4437,4447,
%U A025400 4473,4616,4733,4922,5130,5435,5472,5643,5706,5825,5832,6183,6301,6642,6848,6904
%N A025400 Numbers that are the sum of 3 distinct positive cubes in exactly 2 ways.
%H A025400 Chai Wah Wu, <a href="/A025400/b025400.txt">Table of n, a(n) for n = 1..10000</a>
%F A025400 {n: A025469(n) = 2}. - _R. J. Mathar_, Jun 15 2018
%t A025400 Reap[ For[n = 1, n <= 7000, n++, pr = Select[ PowersRepresentations[n, 3, 3], Times @@ # != 0 && Length[#] == Length[Union[#]] &] ; If[pr != {} && Length[pr] == 2, Print[n, pr]; Sow[n]]]][[2, 1]] (* _Jean-François Alcover_, Jul 31 2013 *)
%t A025400 Module[{nn=20},Select[Tally[Total/@Subsets[Range[nn]^3,{3}]],#[[2]]==2 && #[[1]]<= nn^3-9&][[All,1]]]//Union (* _Harvey P. Dale_, Apr 26 2020 *)
%Y A025400 Cf. A025397 (not necessarily distinct)
%K A025400 nonn
%O A025400 1,1
%A A025400 _David W. Wilson_