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 A323071 #10 Jan 05 2019 08:20:43 %S A323071 1,2,3,1,5,2,7,1,1,2,11,1,13,2,1,1,17,2,19,1,3,2,23,1,1,2,1,1,29,2,31, %T A323071 1,1,2,1,1,37,2,3,1,41,2,43,1,1,2,47,1,1,2,1,1,53,2,5,1,3,2,59,1,61,2, %U A323071 1,1,1,2,67,1,1,2,71,1,73,2,3,1,1,2,79,1,1,2,83,1,1,2,1,1,89,2,1,1,3,2,1,1,97,2,1,1,101,2,103,1,1 %N A323071 a(n) = gcd(n, 1+A060681(n)). %C A323071 Differs from A055023 at n = 55, 105, 155, ..., (A323070). %H A323071 Antti Karttunen, <a href="/A323071/b323071.txt">Table of n, a(n) for n = 1..16384</a> %H A323071 Antti Karttunen, <a href="/A323071/a323071.txt">Data supplement: n, a(n) computed for n = 1..100000</a> %F A323071 a(n) = gcd(n, 1+A060681(n)). %F A323071 a(n) = n/A323072(n). %o A323071 (PARI) %o A323071 A060681(n) = (n-if(1==n,n,n/vecmin(factor(n)[,1]))); %o A323071 A323071(n) = gcd(n,1+A060681(n)); %Y A323071 Cf. A055023, A060681, A323070, A323072. %K A323071 nonn %O A323071 1,2 %A A323071 _Antti Karttunen_, Jan 04 2019