cp's OEIS Frontend

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.

A025394 Numbers that are the sum of 4 distinct nonzero squares in 10 or more ways.

Original entry on oeis.org

270, 294, 318, 330, 342, 350, 351, 354, 366, 375, 378, 382, 390, 398, 399, 402, 406, 410, 414, 422, 426, 429, 430, 434, 435, 438, 441, 442, 446, 450, 455, 459, 462, 465, 466, 470, 471, 474, 478, 483, 486, 490, 494, 495, 498, 501, 506, 507, 510, 513, 515, 518, 519, 522
Offset: 1

Views

Author

Keywords

Comments

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

Crossrefs

Cf. A025443 (number of ways to write n as sum of 4 distinct nonzero squares).
Cf. A025385 (subsequence of terms with A025443(n) = 10 exactly),
Subsequence of A025375 (sums of 4 not necessarily distinct nonzero squares in at least 10 ways).

Formula

{n: A025443(n) >= 10}. - R. J. Mathar, Jun 15 2018