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 A199968 #11 Oct 06 2015 01:47:09 %S A199968 0,0,2,3,2,4,2,3,2,3,2,5,2,3,2,3,2,4,2,3,2,3,2,5,2,3,2,3,2,4,2,3,2,3, %T A199968 2,5,2,3,2,3,2,4,2,3,2,3,2,5,2,3,2,3,2,4,2,3,2,3,2,7,2,3,2,3,2,4,2,3, %U A199968 2,3,2,5,2,3,2,3,2,4,2,3,2,3,2 %N A199968 a(n) = the smallest non-divisor h of n (1<h<n), or 0 if no such h exists. %C A199968 a(n) = A173540(n,1). - _Reinhard Zumkeller_, Oct 02 2015 %H A199968 Reinhard Zumkeller, <a href="/A199968/b199968.txt">Table of n, a(n) for n = 1..10000</a> %F A199968 a(n) = A007978(n) for n>=3. %o A199968 (Haskell) %o A199968 a199968 = head . a173540_row -- _Reinhard Zumkeller_, Oct 02 2015 %Y A199968 Cf. A199969 (the greatest non-divisor h of n (1<h<n)), A199970. %Y A199968 Cf. A173540. %K A199968 nonn %O A199968 1,3 %A A199968 _Jaroslav Krizek_, Nov 26 2011