%I A002380 M2235 N0887
%S A002380 0,1,1,3,1,19,25,11,161,227,681,1019,3057,5075,15225,29291,55105,34243,
%T A002380 233801,439259,269201,1856179,3471385,6219851,1882337,5647011,50495465,
%U A002380 17268667,186023729,21200275,63600825,1264544299,3793632897,7085931395
%N A002380 3^n reduced modulo 2^n.
%C A002380 n such that a(n+1)=3*a(n) is given by A065554 - Benoit Cloitre (benoit7848c(AT)orange.fr), 
               Apr 21 2003
%D A002380 D. H. Lehmer, Guide to Tables in the Theory of Numbers. Bulletin No. 
               105, National Research Council, Washington, DC, 1941, p. 82.
%D A002380 S. S. Pillai, On Waring's problem, J. Indian Math. Soc., 2 (1936), 16-44.
%D A002380 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A002380 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A002380 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               FractionalPart.html">Fractional Part</a>
%H A002380 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               PowerFractionalParts.html">Power Fractional Parts</a>
%p A002380 a:=n->3^n mod(2^n): seq(a(n), n=0..33); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               Feb 15 2008
%t A002380 Table[ PowerMod[3, n, 2^n], {n, 0, 33}] (* from Robert G. Wilson v (rgwv(at)rgwv.com), 
               Dec 14 2006 *)
%o A002380 (PARI) for(n=1,22,print(Mod(3^n,2^n)))
%Y A002380 Sequence in context: A086156 A147076 A027537 this_sequence A073676 A038455 
               A067802
%Y A002380 Adjacent sequences: A002377 A002378 A002379 this_sequence A002381 A002382 
               A002383
%K A002380 nonn,easy
%O A002380 0,4
%A A002380 N. J. A. Sloane (njas(AT)research.att.com).
%E A002380 More terms from Jason Earls (zevi_35711(AT)yahoo.com), Jul 29 2001