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 A283497 #15 Mar 14 2017 00:26:12 %S A283497 0,-1,0,-1,0,0,0,-1,0,0,2,0,1,0,0,-1,0,0,1,0,0,2,3,0,0,2,0,0,2,0,0,-1, %T A283497 0,0,2,0,2,2,4,4,6,0,1,4,3,6,5,0,0,2,2,4,4,0,6,2,2,2,4,0,1,0,0,-1,0,0, %U A283497 1,0,4,4,1,0,3,2,3,4,5,8,2,0,4,10,6,0,8,6,10,4 %N A283497 Remainder when n is divided by A004074(n), or -1 if A004074(n) = 0. %H A283497 Altug Alkan, <a href="/A283497/b283497.txt">Table of n, a(n) for n = 1..10000</a> %H A283497 Altug Alkan, <a href="/A283497/a283497.png">Illustration of A283497</a> %F A283497 a(2^n) = -1 for n > 0. %e A283497 a(11) = 2 because remainder when 11 is divided by A004074(11) = 3 is 2. %Y A283497 Cf. A004001, A004074. %K A283497 sign %O A283497 1,11 %A A283497 _Altug Alkan_, Mar 11 2017