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 A134567 #5 Nov 29 2017 03:35:18
%S A134567 1,3,1,1,8,1,3,1,1,3,1,1,21,1,3,1,1,8,1,3,1,1,3,1,1,8,1,3,1,1,3,1,1,
%T A134567 55,1,3,1,1,8,1,3,1,1,3,1,1,21,1,3,1,1,8,1,3,1,1,3,1,1,8,1,3,1,1,3,1,
%U A134567 1,21,1,3,1,1,8,1,3,1,1,3,1,1,8,1,3,1,1,3,1,1,144,1,3,1,1,8,1,3,1,1,3,1,1,21
%N A134567 a(n) = least m such that {-m*tau} < {n*tau}, where { } denotes fractional part and tau = (1 + sqrt(5))/2.
%C A134567 The terms are members of A001906, the even-indexed Fibonacci numbers. The defining inequality {-m*tau} < {n*tau} is equivalent to {m*tau} + {n*tau} > 1.
%e A134567 a(2)=3 because {-m*tau} > {2*tau} = 0.236... for m=1,2, whereas {-3*tau} = 0.145..., so that 3 is the least m for which {-m*tau} < {3*tau}.
%Y A134567 Cf. A134566, A134570, A134571.
%K A134567 nonn
%O A134567 1,2
%A A134567 _Clark Kimberling_, Nov 01 2007