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 A327254 #17 Sep 30 2019 10:46:27 %S A327254 1,3,5,7,9,10,12,14,16,18,21,23,25,27,29,30,32,34,36,38,41,43,45,47, %T A327254 49,50,52,54,56,58,61,63,65,67,69,70,72,74,76,78,81,83,85,87,89,90,92, %U A327254 94,96,98,99,101,103,105,107,110,112,114,116,118,119,121,123,125 %N A327254 Positions of 0's in {A327253(n) : n > 0}. %C A327254 Although a(n)/n->2, the sequence 2n-a(n) appears to be unbounded above. %C A327254 Positive integers k such that A327253(k) = 0. - _Jianing Song_, Sep 30 2019 %H A327254 Clark Kimberling and Jianing Song, <a href="/A327254/b327254.txt">Table of n, a(n) for n = 1..10000</a> %t A327254 r = Sqrt[6]; z = 300; %t A327254 t = Table[Floor[2 n r] - 2 Floor[n*r], {n, 1, z}] (* {A327253(n) : n > 0} *) %t A327254 Flatten[Position[t, 0]] (* A327254 *) %t A327254 Flatten[Position[t, 1]] (* A327255 *) %Y A327254 Cf. A327253, A327255 (complement). %K A327254 nonn,easy %O A327254 1,2 %A A327254 _Clark Kimberling_, Sep 03 2019 %E A327254 Corrected by _Jianing Song_, Sep 30 2019