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 A190487 #15 Jul 03 2017 02:22:53
%S A190487 1,2,0,1,0,1,2,0,2,0,1,2,1,2,0,1,0,1,2,0,2,0,1,2,1,2,0,1,0,1,2,0,2,0,
%T A190487 1,2,0,2,0,1,2,1,2,0,1,0,1,2,0,2,0,1,2,1,2,0,1,0,1,2,0,2,0,1,2,1,2,0,
%U A190487 1,2,1,2,0,1,0,1,2,0,2,0,1,2,1,2,0,1,0,1,2,0,2,0,1,2,1,2,0,1,0,1,2,0,1,0,1,2,0,2,0,1,2,1,2,0,1,0,1,2,0,2,0,1,2,1,2,0,1,0,1,2,0,2,0,1,2,0,2,0
%N A190487 a(n) = [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(sqrt(2),3,0) and []=floor.
%C A190487 Write a(n) = [(bn+c)r]-b[nr]-[cr]. If r>0 and b and c are integers satisfying b>=2 and 0<=c<=b-1, then 0<=a(n)<=b. The positions of 0 in the sequence a are of interest, as are the position sequences for 1,2,...,b. These b+1 position sequences comprise a partition of the positive integers.
%C A190487 Examples:
%C A190487 (golden ratio,2,1): A190427-A190430
%C A190487 (sqrt(2),2,0): A190480
%C A190487 (sqrt(2),2,1): A190483-A190486
%C A190487 (sqrt(2),3,0): A190487-A190490
%C A190487 (sqrt(2),3,1): A190491-A190495
%C A190487 (sqrt(2),3,2): A190496-A190500
%H A190487 G. C. Greubel, <a href="/A190487/b190487.txt">Table of n, a(n) for n = 1..1000</a>
%t A190487 r = Sqrt[2]; b = 3; c = 0;
%t A190487 f[n_] := Floor[(b*n + c)*r] - b*Floor[n*r] - Floor[c*r];
%t A190487 t = Table[f[n], {n, 1, 200}] (* A190487 *)
%t A190487 Flatten[Position[t, 0]] (* A190488 *)
%t A190487 Flatten[Position[t, 1]] (* A190489 *)
%t A190487 Flatten[Position[t, 2]] (* A190490 *)
%Y A190487 Cf. A190488, A190489, A190490.
%K A190487 nonn
%O A190487 1,2
%A A190487 _Clark Kimberling_, May 11 2011