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 A088901 #9 Oct 11 2017 05:08:18 %S A088901 1,2,4,9,12,16,25,30,36,49,55,56,64,70,81,90,100,121,132,144,169,180, %T A088901 182,196,225,240,256,289,305,306,324,361,377,380,400,441,462,484,529, %U A088901 552,576,625,646,650,676,729,755,756,784,841,870,900,961,987,990,992 %N A088901 Numbers n such that n*k(n) is an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there). %C A088901 Subset of A086378 and A088900. %Y A088901 Cf. A086378 and A088900. %K A088901 nonn %O A088901 1,2 %A A088901 _Thomas Baruchel_, Oct 21 2003