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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070354 3^n mod 16. 0
1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1, 3, 9, 11, 1 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

a(n)=(1/2)*{7*(n mod 4)+[(n+1) mod 4]-[(n+2) mod 4]+[(n+3) mod 4]}, with n>=0. a(n)=6-(2-2*I)*I^n-(-1)^n-(2+2*I)*(-I)^n, with n>=0 and I=sqrt(-1). [From Paolo P. Lava (paoloplava(AT)gmail.com), Feb 25 2010]

a(n) = a(n-4). G.f.: (1+3*x+9*x^2+11*x^3)/ ((1-x) * (1+x) * (1+x^2)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 13 2010]

PROG

(Other) sage: [power_mod(3, n, 16)for n in xrange(0, 93)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 25 2009]

CROSSREFS

Sequence in context: A173242 A121057 A025538 * A174565 A074261 A059868

Adjacent sequences:  A070351 A070352 A070353 * A070355 A070356 A070357

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), May 12 2002

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 15 07:38 EST 2012. Contains 205714 sequences.