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 A366658 #21 Jan 09 2024 18:46:20
%S A366658 1,6,48,324,3840,19800,186624,1365336,16515072,84768120,760320000,
%T A366658 5632621632,64258375680,366369658200,3105655160832,20140520400000,
%U A366658 280012271910912,1495522910085120,12824556668190720,95907982079387520,1080582572777472000,5688765822212629632
%N A366658 a(n) = phi(8^n+1), where phi is Euler's totient function (A000010).
%H A366658 Max Alekseyev, <a href="/A366658/b366658.txt">Table of n, a(n) for n = 0..502</a>
%F A366658 a(n) = A000010(A062395(n)). - _Paul F. Marrero Romero_, Nov 06 2023
%F A366658 a(n) = A053285(3*n). - _Max Alekseyev_, Jan 09 2024
%t A366658 EulerPhi[8^Range[0, 21] + 1] (* _Paul F. Marrero Romero_, Oct 17 2023 *)
%o A366658 (PARI) {a(n) = eulerphi(8^n+1)}
%o A366658 (Python)
%o A366658 from sympy import totient
%o A366658 def A366658(n): return totient((1<<3*n)+1) # _Chai Wah Wu_, Oct 15 2023
%Y A366658 Cf. A062395, A000010, A057936, A274905, A366654, A366655, A366656, A366657, A366671.
%Y A366658 Cf. A053285, A366579, A366608, A366618, A366630, A366639, A366667, A366669, A366690, A366716.
%K A366658 nonn
%O A366658 0,2
%A A366658 _Sean A. Irvine_, Oct 15 2023