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