login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A064536
a(n) = (4^n mod 3^n) mod 2^n.
3
1, 3, 2, 13, 20, 3, 51, 87, 121, 711, 1139, 3537, 8034, 15752, 27922, 49629, 33201, 35975, 143900, 136341, 545364, 2181456, 1060135, 4240540, 16962160, 28647197, 13597858, 205877827, 100616667, 381266393, 1397863922, 3825576990
OFFSET
1,2
COMMENTS
A generalization of A002380. It arises also as a coefficient (=c1) of 1^n=1 in a special (greedy) decomposition of 4^n into like powers as follows: 4^n = c3*3^n + c2*2^n + c1*1^n.
LINKS
FORMULA
n = 7: 4^7 = 16384 = 7*2187 + 8*128 + 51*1 where a(7)=51, the last coefficient; A064630(7) = 7 + 8 + a(7) = 66.
MATHEMATICA
Table[Mod[PowerMod[4, n, 3^n], 2^n], {n, 40}] (* Harvey P. Dale, Apr 09 2013 *)
PROG
(PARI) { for (n=1, 200, write("b064536.txt", n, " ", (4^n % 3^n) % 2^n) ) } \\ Harry J. Smith, Sep 17 2009
KEYWORD
nonn
AUTHOR
Labos Elemer, Oct 08 2001
STATUS
approved