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 A080279 #5 Jan 08 2019 09:12:41 %S A080279 1,8,52,299,437,527,2189,64925 %N A080279 Numbers n such that 1/G^n is closer to its nearest integer than any value of 1/G^k for 1 <= k < n, where G is Catalan's constant. %C A080279 At n=2189 the discrepancy is 0.00000715379617... %e A080279 First term is 1 because this is just 1/G=1.0917440637... Second term is 8 because 1/G^8=2.01821167... which is 0.0182... away from its nearest integer. 1/G^52 is 0.0027 away from 96. %p A080279 a := []: s := 1: n := 1: do: g := 1/Catalan^n: d := round( 30+evalf( ilog10( g ) ) ): b := evalf(g,d): c := round(b): f := evalf(abs(c-b),d): if f<s then a := [op(a),n]: print(n): s := f: fi: n := n+1: od: %Y A080279 Cf. A079490, A080052, A080053. %K A080279 nonn,more %O A080279 1,2 %A A080279 Mark Hudson (mrmarkhudson(AT)hotmail.com), Feb 13 2003 %E A080279 More terms from _Michel ten Voorde_ Jun 20 2003