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 A104363 #16 Oct 03 2022 17:17:14
%S A104363 1,4,10,58,178,1258,2280,7558,37798,415798,1229760,16144536,113488440,
%T A104363 567495336,1135133998,19295619336,56915913600,1085995965600,
%U A104363 5499724229998,37888326510336,423202615117920,9425816095466520,29220034833989998,146100157813443360,1882777893068160000,5683471349506454400,39885027849235856880
%N A104363 Euler's totient of A104357(n) = A104350(n) - 1.
%H A104363 Max Alekseyev, <a href="/A104363/b104363.txt">Table of n, a(n) for n = 2..145</a> (terms for n = 2..74 from Amiram Eldar)
%H A104363 Reinhard Zumkeller, <a href="/A104350/a104350.txt">Products of largest prime factors of numbers <= n</a>
%F A104363 a(n) = A000010(A104357(n)).
%t A104363 a[n_] := EulerPhi[-1 + Product[FactorInteger[k][[-1, 1]], {k, 1, n}]]; Array[a, 50, 2] (* _Amiram Eldar_, Feb 12 2020 *)
%Y A104363 Cf. A000010, A104357, A104358, A104359, A104360, A104361, A104362, A104364, A104371.
%K A104363 nonn
%O A104363 2,2
%A A104363 _Reinhard Zumkeller_, Mar 06 2005