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 A182167 #16 Oct 18 2015 08:53:25 %S A182167 0,1,1,1,0,2,1,3,2,5,1,0,1,1,5,5,1,8,1,5,5,1,1,0,0,1,7,11,1,10,1,5,13, %T A182167 1,5,0,1,1,2,5,1,8,1,19,20,1,1,0,13,25,19,23,1,8,5,21,17,1,1,0,1,1,20, %U A182167 5,5,14,1,3,25,15,1,0,1,1,25,3,2,34,1,5,7 %N A182167 Min( f(n), n-f(n) ), where f(n) = A002708(n) = Fibonacci(n) mod n. %C A182167 Conjecture: the most frequent values are 0,1,2,3,5,8,13,21,34,... i.e Fibonacci numbers. %H A182167 Charles R Greathouse IV, <a href="/A182167/b182167.txt">Table of n, a(n) for n = 1..10000</a> %F A182167 a(n) = min( A002708(n) , n - A002708(n) ) %F A182167 a(n) = min( Fibonacci(n) mod n , n - (Fibonacci(n) mod n) ) %e A182167 a(1) = min( A002708(1) , 1 - A002708(1) ) = min(0,1) = 0, a(4) = min(3,1) = 1, a(5) = min(0,5) = 0 %o A182167 (PARI) a(n)=my(f=lift(((Mod([1,1;1,0],n))^n)[1,2]));min(f,n-f) \\ _Charles R Greathouse IV_, Apr 16 2012 %Y A182167 Cf. A000045, A002708. %K A182167 nonn %O A182167 1,6 %A A182167 _Alex Ratushnyak_, Apr 15 2012