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 A323072 #10 Jan 05 2019 08:20:50 %S A323072 1,1,1,4,1,3,1,8,9,5,1,12,1,7,15,16,1,9,1,20,7,11,1,24,25,13,27,28,1, %T A323072 15,1,32,33,17,35,36,1,19,13,40,1,21,1,44,45,23,1,48,49,25,51,52,1,27, %U A323072 11,56,19,29,1,60,1,31,63,64,65,33,1,68,69,35,1,72,1,37,25,76,77,39,1,80,81,41,1,84,85,43,87,88,1,45,91,92,31,47 %N A323072 a(n) = n/A323071(n) = n/gcd(n, 1+A060681(n)). %C A323072 Differs from A055032 at n = 55, 105, 155, ..., (A323070). %H A323072 Antti Karttunen, <a href="/A323072/b323072.txt">Table of n, a(n) for n = 1..16384</a> %H A323072 Antti Karttunen, <a href="/A323072/a323072.txt">Data supplement: n, a(n) computed for n = 1..100000</a> %F A323072 a(n) = n/A323071(n) = n/gcd(n, 1+A060681(n)). %o A323072 (PARI) %o A323072 A060681(n) = (n-if(1==n,n,n/vecmin(factor(n)[,1]))); %o A323072 A323071(n) = gcd(n,1+A060681(n)); %o A323072 A323072(n) = (n/A323071(n)); %Y A323072 Cf. A055032, A060681, A323070, A323071. %K A323072 nonn %O A323072 1,4 %A A323072 _Antti Karttunen_, Jan 04 2019