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 A025394 #24 Aug 03 2025 23:18:00
%S A025394 270,294,318,330,342,350,351,354,366,375,378,382,390,398,399,402,406,
%T A025394 410,414,422,426,429,430,434,435,438,441,442,446,450,455,459,462,465,
%U A025394 466,470,471,474,478,483,486,490,494,495,498,501,506,507,510,513,515,518,519,522
%N A025394 Numbers that are the sum of 4 distinct nonzero squares in 10 or more ways.
%C A025394 The common sum of rows, columns and diagonals of magic squares whose entries are distinct squares must be terms of this sequence. - _M. F. Hasler_, Jul 22 2025
%H A025394 M. F. Hasler, <a href="/A025394/b025394.txt">Table of n, a(n) for n = 1..10000</a>
%H A025394 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%F A025394 {n: A025443(n) >= 10}. - _R. J. Mathar_, Jun 15 2018
%Y A025394 Cf. A025443 (number of ways to write n as sum of 4 distinct nonzero squares).
%Y A025394 Cf. A025385 (subsequence of terms with A025443(n) = 10 exactly),
%Y A025394 Subsequence of A025375 (sums of 4 not necessarily distinct nonzero squares in at least 10 ways).
%K A025394 nonn
%O A025394 1,1
%A A025394 _David W. Wilson_