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!)
A366663 a(n) = phi(9^n-1), where phi is Euler's totient function (A000010). 14

%I #13 Jan 07 2024 13:34:19

%S 4,32,288,2560,26400,165888,2384928,15728640,141087744,1246080000,

%T 14758128000,85996339200,1270928131200,8810420097024,70207948800000,

%U 677066362060800,8218041445152000,43129128265187328,674757689572915200,4238841176064000000

%N a(n) = phi(9^n-1), where phi is Euler's totient function (A000010).

%H Max Alekseyev, <a href="/A366663/b366663.txt">Table of n, a(n) for n = 1..690</a>

%F a(n) = A295500(2*n) = 2 * A295500(n) * A366579(n). - _Max Alekseyev_, Jan 07 2024

%t EulerPhi[9^Range[30] - 1]

%o (PARI) {a(n) = eulerphi(9^n-1)}

%Y phi(k^n-1): A053287 (k=2), A295500 (k=3), A295501 (k=4), A295502 (k=5), A366623 (k=6), A366635 (k=7), A366654 (k=8), this sequence (k=9), A295503 (k=10), A366685 (k=11), A366711 (k=12).

%Y Cf. A000010, A024101, A057952, A366660, A366661, A366662, A366667.

%K nonn

%O 1,1

%A _Sean A. Irvine_, Oct 15 2023

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 July 22 08:27 EDT 2024. Contains 374485 sequences. (Running on oeis4.)