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 A289836 #20 May 10 2021 02:36:08 %S A289836 5,17,29,36,52,71,132,146,177,211,229,330,648,744,956,1112,1368,1413, %T A289836 1459,1506,1700,1906,2124,2295,2657,2720,2848,2913,2979,3181,3319, %U A289836 3532,3678,3902,3978,4055,4211,4290,4780,5035 %N A289836 Numbers k such that floor(e*k + Pi) is a square. %H A289836 Charles R Greathouse IV, <a href="/A289836/b289836.txt">Table of n, a(n) for n = 1..10000</a> %t A289836 Select[Range@ 5040, IntegerQ@ Sqrt@ Floor[# E + Pi] &] (* _Michael De Vlieger_, Jul 14 2017 *) %o A289836 (PARI) is(n)=issquare(floor(exp(1)*n+Pi)) \\ _Charles R Greathouse IV_, Jul 14 2017 %o A289836 (Python) %o A289836 from gmpy2 import is_square %o A289836 from mpmath import * %o A289836 mp.dps=100 %o A289836 def ok(n): return is_square(int(nint(floor(exp(1)*n + pi)))) %o A289836 print([n for n in range(1, 6001) if ok(n)]) # _Indranil Ghosh_, Jul 15 2017 %K A289836 nonn %O A289836 1,1 %A A289836 _Joseph Wheat_, Jul 13 2017 %E A289836 More terms from _Charles R Greathouse IV_, Jul 14 2017