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 A345942 #10 Jul 05 2021 15:39:32 %S A345942 1,1,1,1,1,2,1,4,3,2,1,4,1,2,3,4,1,2,1,4,3,2,1,8,1,2,9,4,1,6,1,16,3,2, %T A345942 5,4,1,2,3,8,1,6,1,4,9,2,1,16,7,2,3,4,1,6,5,8,3,2,1,12,1,2,9,16,5,6,1, %U A345942 4,3,10,1,8,1,2,3,4,7,6,1,16,27,2,1,12,5,2,3,8,1,18,7,4,3,2,5,32,1,2,9,20,1,6 %N A345942 a(n) = n / gcd(n, A329044(n)). %H A345942 Antti Karttunen, <a href="/A345942/b345942.txt">Table of n, a(n) for n = 1..19683</a> %H A345942 Antti Karttunen, <a href="/A345942/a345942.txt">Data supplement: n, a(n) computed for n = 1..65537</a> %H A345942 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %H A345942 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a> %H A345942 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a> %F A345942 a(n) = n / A345941(n). %o A345942 (PARI) A345942(n) = (n/gcd(n,A329044(n))); \\ Rest of program given in A329044. %Y A345942 Cf. A108951, A324886, A329044, A345941, A345943. %K A345942 nonn %O A345942 1,6 %A A345942 _Antti Karttunen_, Jul 03 2021