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 A330749 #7 Dec 29 2019 19:35:29
%S A330749 1,1,1,1,1,2,1,1,1,1,1,2,1,1,3,1,1,2,1,1,1,1,1,2,1,1,1,1,1,6,1,1,1,1,
%T A330749 5,4,1,1,1,1,1,2,1,1,3,1,1,2,1,1,1,1,1,2,1,1,1,1,1,6,1,1,1,1,1,2,1,1,
%U A330749 1,5,1,4,1,1,3,1,7,2,1,1,1,1,1,2,1,1,1,1,1,6,1,1,1,1,1,2,1,1,1,1,1,2,1,1,15
%N A330749 a(n) = gcd(n, A064989(n)), where A064989 is fully multiplicative with a(2) = 1 and a(prime(k)) = prime(k-1) for odd primes.
%H A330749 Antti Karttunen, <a href="/A330749/b330749.txt">Table of n, a(n) for n = 1..65537</a>
%F A330749 a(n) = gcd(n, A064989(n)).
%F A330749 a(n) = n / A319626(n).
%F A330749 a(n) = A064989(A322361(n)).
%o A330749 (PARI) A330749(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); gcd(n,factorback(f)); };
%Y A330749 Cf. A064989, A319626, A322361.
%K A330749 nonn
%O A330749 1,6
%A A330749 _Antti Karttunen_, Dec 29 2019