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

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

0,2

FORMULA

a(n)=(1/50)*{173*(n mod 5)-67*[(n+1) mod 5]+73*[(n+2) mod 5]-27*[(n+3) mod 5]+13*[(n+4) mod 5]}, with n>=0 [From Paolo P. Lava (paoloplava(AT)gmail.com), Feb 25 2010]

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

PROG

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

CROSSREFS

Sequence in context: A084492 A084496 A084530 * A129145 A064471 A054509

Adjacent sequences:  A070352 A070353 A070354 * A070356 A070357 A070358

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 14 11:17 EST 2012. Contains 205623 sequences.