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 A272181 #11 Apr 27 2016 23:55:37 %S A272181 1,2,3,2,2,6,7,2,2,3,2,5,3,2,3,2,2,3,4,2,3,2,2,4,4,2,3,3,2,2,3,2,3,2, %T A272181 2,36,2,2,3,4,2,2,3,2,9,2,2,3,4,2,3,7,4,2,3,2,3,2,2,4,5,2,3,4,2,2,3,2, %U A272181 4,2,3,2,3,2 %N A272181 a(1) = 1; a(n) = n mod a(k), k being the largest value such that n mod a(k) > 1, or n if there is no such k. %H A272181 Cody M. Haderlie, <a href="/A272181/b272181.txt">Table of n, a(n) for n = 1..100000</a> %e A272181 a(5) = 2; k = 3 and 5 mod a(3) = 2. %K A272181 nonn %O A272181 1,2 %A A272181 _Cody M. Haderlie_, Apr 21 2016