login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A366690 a(n) = phi(11^n+1), where phi is Euler's totient function (A000010). 13
1, 4, 60, 432, 7320, 53680, 803520, 6495720, 100874752, 764738496, 12756110400, 89493288192, 1568774615040, 11278053084480, 180228847518720, 1310982643872000, 22974417331646464, 168479281019744640, 2521788545778163200, 20190830281379049600 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = A000010(A034524(n)). - Paul F. Marrero Romero, Nov 10 2023
MATHEMATICA
EulerPhi[11^Range[0, 19] + 1] (* Paul F. Marrero Romero, Nov 10 2023 *)
PROG
(PARI) {a(n) = eulerphi(11^n+1)}
CROSSREFS
Sequence in context: A234952 A112041 A210425 * A002060 A247739 A007220
KEYWORD
nonn
AUTHOR
Sean A. Irvine, Oct 16 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 1 23:54 EDT 2024. Contains 372178 sequences. (Running on oeis4.)