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 A089808 #8 Nov 20 2017 23:31:31
%S A089808 2,1,6,1,1,3,1,17,2,1,4,1,1,2,1,8,2,1,3,1,46,2,1,5,1,1,3,1,12,2,1,4,1,
%T A089808 1,2,1,7,1,1,3,1,23,2,1,5,1,1,2,1,10,2,1,4,1,122,2,1,6,1,1,3,1,15,2,1,
%U A089808 4,1,1,2,1,8,1,1,3,1,33,2,1,5,1,1,3,1,11,2,1,4,1,1,2,1,7,1,1,3,1,19,2,1,5,1
%N A089808 a(n) = floor(1/((n*r) mod 1)), where r = phi^(-2) = (3 - sqrt(5))/2.
%C A089808 1. a(n) = 1 iff A024569 is not 1, (A024569 = 1, 4, 1, 2, 11, 1, 3, 1, 1, ...)
%C A089808 2. a(n) = 1 iff A078588 = 0.
%C A089808 3. a(n) = 1 iff A089809 = 1.
%H A089808 G. C. Greubel, <a href="/A089808/b089808.txt">Table of n, a(n) for n = 1..5000</a>
%e A089808 a(6) = 3. Take 6*r = 2.29179...( mod 1) = 0.29179...; invert = 3.42705... and delete the fractional part, getting 3.
%t A089808 r := (3 - Sqrt[5])/2; Table[Floor[1/(Mod[(n*r), 1])], {n, 1, 50}] (* _G. C. Greubel_, Nov 20 2017 *)
%Y A089808 Cf. A024569, A078588, A089809.
%K A089808 nonn,easy
%O A089808 1,1
%A A089808 _Gary W. Adamson_, Nov 11 2003
%E A089808 More terms from _Sam Alexander_, Nov 16 2003