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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070339 a(n) = 2^n mod 35. 2
1, 2, 4, 8, 16, 32, 29, 23, 11, 22, 9, 18, 1, 2, 4, 8, 16, 32, 29, 23, 11, 22, 9, 18, 1, 2, 4, 8, 16, 32, 29, 23, 11, 22, 9, 18, 1, 2, 4, 8, 16, 32, 29, 23, 11, 22, 9, 18, 1, 2, 4, 8, 16, 32, 29, 23, 11, 22, 9, 18, 1, 2, 4, 8, 16, 32, 29, 23, 11, 22, 9, 18 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = a(n-12). - G. C. Greubel, Mar 13 2016

MATHEMATICA

PowerMod[2, Range[0, 50], 35] (* G. C. Greubel, Mar 13 2016 *)

PROG

(Sage) [power_mod(2, n, 35)for n in xrange(0, 72)] # Zerinvary Lajos, Nov 03 2009

(PARI) a(n)=lift(Mod(2, 35)^n) \\ Charles R Greathouse IV, Mar 22 2016

CROSSREFS

Sequence in context: A130670 A070340 A036124 * A070338 A115423 A221467

Adjacent sequences:  A070336 A070337 A070338 * A070340 A070341 A070342

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, May 12 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified April 29 04:13 EDT 2016. Contains 272146 sequences.