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 A336468 #8 Jul 25 2020 10:34:40
%S A336468 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,5,1,1,1,1,1,3,1,1,1,1,1,
%T A336468 1,1,1,1,1,1,1,1,3,1,1,5,11,1,3,1,1,1,3,1,1,1,1,3,7,1,1,1,1,1,1,1,5,1,
%U A336468 5,1,3,1,1,1,1,1,1,1,3,1,1,1,5,1,1,3,3,1,5,1,1,5,1,11,1,1,1,3,1,1,1,1,1,1,1
%N A336468 a(n) = A336466(phi(n)), where A336466 is fully multiplicative with a(p) = A000265(p-1) for prime p, with A000265(k) giving the odd part of k.
%H A336468 Antti Karttunen, <a href="/A336468/b336468.txt">Table of n, a(n) for n = 1..16384</a>
%H A336468 Antti Karttunen, <a href="/A336468/a336468.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%F A336468 a(n) = A336466(A000010(n)).
%F A336468 Multiplicative with a(p^e) = A336466(p-1) * A336466(p)^(e-1).
%o A336468 (PARI)
%o A336468 A000265(n) = (n>>valuation(n,2));
%o A336468 A336468(n) = { my(f=factor(eulerphi(n))); prod(k=1,#f~,A000265(f[k,1]-1)^f[k,2]); };
%o A336468 \\ Alternatively, as follows, requiring also code from A336466:
%o A336468 A336468(n) = { my(f=factor(n)); prod(k=1,#f~,A336466(f[k,1]-1) * A336466(f[k,1])^(f[k,2]-1)); };
%Y A336468 Cf. A000010, A000265, A336466, A336469.
%K A336468 nonn,mult
%O A336468 1,23
%A A336468 _Antti Karttunen_, Jul 22 2020