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 A336850 #14 Aug 06 2020 23:28:31 %S A336850 1,1,1,1,1,3,1,1,1,1,1,3,1,3,1,1,1,1,1,1,1,1,1,15,1,3,1,3,1,3,1,1,1,1, %T A336850 1,1,1,3,1,1,1,3,1,13,1,3,1,3,1,3,5,9,1,3,7,3,1,1,1,3,1,1,1,1,1,3,1,1, %U A336850 5,3,1,5,1,3,1,3,1,3,1,1,1,1,1,9,1,3,1,1,1,1,1,3,1,3,1,3,1,1,1,3,1,15,1,9,1 %N A336850 a(n) = gcd(A003961(n), sigma(A003961(n))), where A003961 is the prime shift towards larger primes. %H A336850 Antti Karttunen, <a href="/A336850/b336850.txt">Table of n, a(n) for n = 1..16384</a> %H A336850 Antti Karttunen, <a href="/A336850/a336850.txt">Data supplement: n, a(n) computed for n = 1..65537</a> %H A336850 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %H A336850 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a> %F A336850 a(n) = gcd(A003961(n), A003973(n)) = gcd(A003961(n), A336851(n)). %F A336850 a(n) = A009194(A003961(n)). %F A336850 a(n) = A003961(n) / A336849(n). %o A336850 (PARI) A336850(n) = gcd(A003961(n),sigma(A003961(n))); %Y A336850 Cf. A003961, A003973, A009194, A336849, A336851. %K A336850 nonn %O A336850 1,6 %A A336850 _Antti Karttunen_, Aug 05 2020