[go: up one dir, main page]

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”).

A066606
a(n) = 2^n mod n^2.
11
0, 0, 8, 0, 7, 28, 30, 0, 26, 24, 112, 64, 80, 116, 143, 0, 155, 28, 116, 176, 197, 444, 255, 64, 57, 316, 80, 128, 60, 424, 374, 0, 602, 616, 18, 784, 76, 460, 944, 576, 207, 1324, 303, 1600, 782, 1016, 1929, 1792, 2382, 124, 1844, 2512, 1009, 568, 1693, 704
OFFSET
1,3
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..10000 (first 1000 terms from Harry J. Smith)
EXAMPLE
a(7) = 30 as 2^7 = 128 = (7^2)*2 + 30.
MAPLE
a:= n-> 2&^n mod (n^2):
seq(a(n), n=1..100); # Alois P. Heinz, Jul 04 2017
MATHEMATICA
Table[PowerMod[2, n, n^2], {n, 60}] (* Harvey P. Dale, Dec 08 2015 *)
PROG
(PARI) a(n) = { lift(Mod(2, n^2)^n) } \\ Harry J. Smith, Mar 10 2010
CROSSREFS
Sequence in context: A262522 A174849 A133741 * A048729 A003131 A010679
KEYWORD
easy,nonn,changed
AUTHOR
Amarnath Murthy, Dec 22 2001
EXTENSIONS
More terms from Floor van Lamoen and Robert G. Wilson v, Dec 23 2001
STATUS
approved