[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A377674
a(n) = phi(n^n + n) where phi is the Euler totient function.
5
1, 2, 8, 96, 1248, 12000, 259200, 5461344, 129140160, 2725643520, 127561104000, 2743415522496, 139778722137600, 2504616361228800, 111747349423990784, 8644660582219776000, 387774574486565683200, 12306643656809728412160, 816897235219321957908480
OFFSET
1,2
LINKS
FORMULA
a(n) = A000010(A066068(n)).
MATHEMATICA
a[n_] := EulerPhi[n^n + n]; Array[a, 20] (* Amiram Eldar, Nov 04 2024 *)
PROG
(PARI) a(n) = eulerphi(n^n+n);
KEYWORD
nonn
AUTHOR
Sean A. Irvine, Nov 03 2024
STATUS
approved