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 A318829 #11 Sep 09 2018 19:14:28
%S A318829 1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%T A318829 2,1,1,1,2,1,1,1,1,1,2,1,1,1,1,1,2,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,1,1,
%U A318829 1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,4,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,1,1,2
%N A318829 a(n) = A063994(n) / A049559(n) = (1/gcd(n-1, phi(n))) * Product_{primes p dividing n} gcd(p-1, n-1).
%C A318829 Records occur at: 1, 15, 85, 247, 671, 949, 1105, 1387, 2047, 2821, 9471, 11305, 13747, 13981, 29341, 40885, 51319, 63973, ...
%H A318829 Antti Karttunen, <a href="/A318829/b318829.txt">Table of n, a(n) for n = 1..65537</a>
%F A318829 a(n) = A063994(n) / A049559(n).
%F A318829 a(n) = A160595(n) / A247074(n).
%o A318829 (PARI)
%o A318829 A049559(n) = gcd(eulerphi(n), n-1); \\ From A049559
%o A318829 A063994(n) = { my(f=factor(n)[,1]); prod(i=1, #f, gcd(f[i]-1, n-1)); };
%o A318829 A318829(n) = (A063994(n)/A049559(n));
%Y A318829 Cf. A049559, A063994, A160595, A247074, A318828.
%K A318829 nonn
%O A318829 1,15
%A A318829 _Antti Karttunen_, Sep 09 2018