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 A190886 #10 Jul 10 2020 03:51:10
%S A190886 1,2,3,4,0,2,3,4,0,1,2,4,0,1,2,3,0,1,2,3,4,0,2,3,4,0,1,3,4,0,1,2,3,0,
%T A190886 1,2,3,4,1,2,3,4,0,1,3,4,0,1,2,4,0,1,2,3,4,1,2,3,4,0,2,3,4,0,1,2,4,0,
%U A190886 1,2,3,4,1,2,3,4,0,2,3,4,0,1,2,4,0,1,2,3,0,1,2,3,4,0,2,3,4,0,1,3,4,0,1,2,3,0,1,2,3,4,1,2,3,4,0,1,3,4,0,1,2,4,0,1,2,3,4,1,2,3,4,0
%N A190886 a(n) = [5nr]-5[nr], where r=sqrt(5).
%C A190886 In general, suppose that 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. For c=0, there are b of these position sequences, and they comprise a partition of the positive integers.
%F A190886 a(n) = [5nr]-5[nr], where r=sqrt(5).
%t A190886 r = Sqrt[5];
%t A190886 f[n_] := Floor[5n*r] - 5*Floor[n*r]
%t A190886 t = Table[f[n], {n, 1, 400}] (* A190886 *)
%t A190886 Flatten[Position[t, 0]] (* A190887 *)
%t A190886 Flatten[Position[t, 1]] (* A190888 *)
%t A190886 Flatten[Position[t, 2]] (* A190889 *)
%t A190886 Flatten[Position[t, 3]] (* A190890 *)
%t A190886 Flatten[Position[t, 4]] (* A190891 *)
%Y A190886 Cf. A190887, A190888, A190889, A190890, A190891.
%K A190886 nonn
%O A190886 1,2
%A A190886 _Clark Kimberling_, May 26 2011