login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066606 2^n mod n^2. 2
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 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

EXAMPLE

a(7) = 30 as 2^7 = 128 = (7^2)*2 + 30

MATHEMATICA

Table[ Mod[ 2^n, n^2], {n, 1, 60} ]

PROG

(PARI) { for (n=1, 1000, write("b066606.txt", n, " ", 2^n % n^2) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Mar 10 2010]

CROSSREFS

Sequence in context: A198221 A183001 A133741 * A048729 A003131 A010679

Adjacent sequences:  A066603 A066604 A066605 * A066607 A066608 A066609

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 22 2001

EXTENSIONS

More terms from Floor van Lamoen (fvlamoen(AT)hotmail.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 23 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:04 EST 2012. Contains 205686 sequences.