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!)
A366658 a(n) = phi(8^n+1), where phi is Euler's totient function (A000010). 10
1, 6, 48, 324, 3840, 19800, 186624, 1365336, 16515072, 84768120, 760320000, 5632621632, 64258375680, 366369658200, 3105655160832, 20140520400000, 280012271910912, 1495522910085120, 12824556668190720, 95907982079387520, 1080582572777472000, 5688765822212629632 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = A000010(A062395(n)). - Paul F. Marrero Romero, Nov 06 2023
a(n) = A053285(3*n). - Max Alekseyev, Jan 09 2024
MATHEMATICA
EulerPhi[8^Range[0, 21] + 1] (* Paul F. Marrero Romero, Oct 17 2023 *)
PROG
(PARI) {a(n) = eulerphi(8^n+1)}
(Python)
from sympy import totient
def A366658(n): return totient((1<<3*n)+1) # Chai Wah Wu, Oct 15 2023
CROSSREFS
Sequence in context: A165758 A166152 A300582 * A049316 A320072 A024075
KEYWORD
nonn
AUTHOR
Sean A. Irvine, Oct 15 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 14:59 EDT 2024. Contains 372174 sequences. (Running on oeis4.)