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 A195119 #21 Jun 22 2024 06:24:52
%S A195119 0,1,2,2,3,3,4,5,5,6,6,7,8,8,9,9,10,10,11,12,12,13,13,14,15,15,16,16,
%T A195119 17,17,18,19,19,20,20,21,22,22,23,23,24,25,25,26,26,27,27,28,29,29,30,
%U A195119 30,31,32,32,33,33,34,34,35,36,36,37,37,38,39,39,40,40,41,42,42
%N A195119 a(n) = 2*n - floor(n*sqrt(2)).
%C A195119 Not A077467, which has only one 17; not A098294, which has two 41's.
%H A195119 Vincenzo Librandi, <a href="/A195119/b195119.txt">Table of n, a(n) for n = 0..10000</a>
%F A195119 a(n) = A005843(n) - A001951(n). - _Michel Marcus_, Sep 30 2018
%p A195119 seq(2*n-floor(n*sqrt(2)),n=0..80); # _Muniru A Asiru_, Sep 30 2018
%t A195119 Table[2*n - Floor[n*Sqrt[2]], {n,0,100}] (* _G. C. Greubel_, Sep 29 2018 *)
%o A195119 (Magma) [2*n-Floor(n*Sqrt(2)): n in [0..70]]; // _Vincenzo Librandi_, Sep 12 2011
%o A195119 (PARI) vector(100, n, n--; 2*n-floor(n*sqrt(2))) \\ _G. C. Greubel_, Sep 29 2018
%Y A195119 Cf. A005843 (2n), A001951 (floor(n*sqrt(2))).
%K A195119 nonn,easy
%O A195119 0,3
%A A195119 _Clark Kimberling_, Sep 09 2011