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!)
A138955 a(n) = 8^n mod 3^n. 0

%I #12 Dec 07 2019 12:18:25

%S 0,2,1,26,46,206,433,2006,739,19034,53857,76562,435349,1357028,

%T 1290286,5539319,1267831,96236090,124187905,993503240,974457118,

%U 4308872543,13550273938,45640072286,176834220634,567385155629,1149926807260,6657548629751,22757999098060

%N a(n) = 8^n mod 3^n.

%o (Sage) [power_mod(8,n,3^n)for n in range(0,29)] # _Zerinvary Lajos_, Nov 28 2009

%o (PARI) a(n) = if (n, lift(Mod(8, 3^n)^n), 0); \\ _Michel Marcus_, Feb 20 2018

%Y Cf. A000244, A001018.

%K nonn

%O 0,2

%A _N. J. A. Sloane_, May 20 2008

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 April 23 14:32 EDT 2024. Contains 371914 sequences. (Running on oeis4.)