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 A049472 #33 Sep 10 2023 01:53:03 %S A049472 0,0,1,2,2,3,4,4,5,6,7,7,8,9,9,10,11,12,12,13,14,14,15,16,16,17,18,19, %T A049472 19,20,21,21,22,23,24,24,25,26,26,27,28,28,29,30,31,31,32,33,33,34,35, %U A049472 36,36,37,38,38,39,40,41,41,42,43,43,44,45,45,46,47 %N A049472 a(n) = floor(n/sqrt(2)). %C A049472 For n > 0: A006337(n) = number of repeating n's. - _Reinhard Zumkeller_, Jul 04 2015 %H A049472 Vincenzo Librandi, <a href="/A049472/b049472.txt">Table of n, a(n) for n = 0..10000</a> %H A049472 Robbert Fokkink, <a href="https://arxiv.org/abs/2309.01644">The Pell Tower and Ostronometry</a>, arXiv:2309.01644 [math.CO], 2023. %H A049472 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a> %p A049472 A049472:=n->floor(n/sqrt(2)): seq(A049472(n), n=0..100); # _Wesley Ivan Hurt_, Jun 25 2016 %t A049472 Floor[Range[0,70]/Sqrt[2]] (* _Harvey P. Dale_, Aug 22 2011 *) %o A049472 (Magma) [Floor(n/Sqrt(2)): n in [0..70] ]; // _Vincenzo Librandi_, Aug 23 2011 %o A049472 (Haskell) %o A049472 a049472 = floor . (/ sqrt 2) . fromIntegral %o A049472 -- _Reinhard Zumkeller_, Jul 04 2015 %o A049472 (PARI) a(n)=sqrtint(n^2\2) \\ _Charles R Greathouse IV_, Sep 02 2015 %Y A049472 First differences give A080764. %Y A049472 Cf. A006337, A049474. %K A049472 nonn,easy %O A049472 0,4 %A A049472 _Thomas Kellar_