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 A088900 #9 Oct 11 2017 05:08:01 %S A088900 1,2,4,6,9,12,16,20,25,30,36,42,49,55,56,64,70,72,81,90,100,110,121, %T A088900 132,144,155,156,169,180,182,196,210,225,240,256,272,289,305,306,324, %U A088900 342,361,377,380,400,420,441,462,484,504,505,506,529,546,552,576,600,625 %N A088900 Numbers n such that 2*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 A088900 Subset of A086378. %Y A088900 Cf. A086378. %K A088900 nonn %O A088900 1,2 %A A088900 _Thomas Baruchel_, Oct 21 2003