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 A356166 #10 Jul 28 2022 21:16:07
%S A356166 1,2,1,4,1,2,1,8,1,2,1,4,1,2,3,16,1,2,1,4,1,2,1,8,1,2,1,4,1,6,1,32,1,
%T A356166 2,5,4,1,2,1,8,1,2,1,4,3,2,1,16,1,2,1,4,1,2,1,8,1,2,1,12,1,2,1,64,1,2,
%U A356166 1,4,1,10,1,8,1,2,3,4,7,2,1,16,1,2,1,4,1,2,1,8,1,6,1,4,1,2,1,32,1,2,1,4,1,2,1,8,5
%N A356166 Greatest common divisor of n and the smallest positive k such that n divides k*A003961(k), where A003961 is fully multiplicative with a(p) = nextprime(p).
%H A356166 Antti Karttunen, <a href="/A356166/b356166.txt">Table of n, a(n) for n = 1..65537</a>
%H A356166 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A356166 a(n) = gcd(n, A356164(n)) = gcd(n, A356165(n)) = gcd(A356164(n), A356165(n)).
%o A356166 (PARI)
%o A356166 A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
%o A356166 A356166(n) = for(k=1, oo, if((k*A003961(k))%n==0, return(gcd(n,k))));
%Y A356166 Cf. A003961, A191002, A356164, A356165, A356167, A356168, A356171 (positions of 1's), A356172.
%Y A356166 Cf. also A345992, A356151.
%K A356166 nonn,look
%O A356166 1,2
%A A356166 _Antti Karttunen_, Jul 28 2022