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!)
A064854 a(n) = ((5^n mod 4^n) mod 3^n) mod 2^n. 2

%I #9 Jun 19 2018 05:13:56

%S 1,0,7,0,21,37,118,56,19,428,808,3920,2256,15240,28312,46733,128931,

%T 251439,434788,645833,1397733,1179155,7185704,1551886,33308648,

%U 65879944,121274199,65829274,228529703,248939750,799831532,2835988891

%N a(n) = ((5^n mod 4^n) mod 3^n) mod 2^n.

%C A generalization of A002380 and A064536. It arises also as a coefficient (=c1) of 1^n=1 in a special (greedy) decomposition of 5^n into like powers as follows: 5^n = c4*4^n + c3*3^n + c2*2^n + c1*1^n.

%H Harry J. Smith, <a href="/A064854/b064854.txt">Table of n, a(n) for n = 1..200</a>

%F n = 7: 5^7 = 78125 = 4*16384 + 5*2187 + 12*128 + 118*1, where a(7)=118, the last coefficient.

%o (PARI) { for (n=1, 200, a=((5^n%4^n)%3^n)%2^n; write("b064854.txt", n, " ", a) ) } \\ _Harry J. Smith_, Sep 28 2009

%Y Cf. A002380, A064536, A064855, A060692, A064628-A064631.

%K nonn

%O 1,3

%A _Labos Elemer_, Oct 08 2001

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 25 05:55 EDT 2024. Contains 371964 sequences. (Running on oeis4.)