The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070362 a(n) = 3^n mod 44. 1
 1, 3, 9, 27, 37, 23, 25, 31, 5, 15, 1, 3, 9, 27, 37, 23, 25, 31, 5, 15, 1, 3, 9, 27, 37, 23, 25, 31, 5, 15, 1, 3, 9, 27, 37, 23, 25, 31, 5, 15, 1, 3, 9, 27, 37, 23, 25, 31, 5, 15, 1, 3, 9, 27, 37, 23, 25, 31, 5, 15, 1, 3, 9, 27, 37, 23, 25, 31, 5, 15, 1, 3, 9, 27, 37, 23, 25, 31, 5, 15 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,1). FORMULA a(n) = (1/225)*{403*(n mod 10)-137*[(n+1) mod 10]+673*[(n+2) mod 10]-47*[(n+3) mod 10]+43*[(n+4) mod 10]+403*[(n+5) mod 10]-137*[(n+6) mod 10]-317*[(n+7) mod 10]-47*[(n+8) mod 10]+43*[(n+9) mod 10]}, with n>=0. - Paolo P. Lava, Feb 24 2010 From _R. J. Mather_, Apr 20 2010: (Start) a(n) = a(n-10). G.f.: ( -1-3*x-9*x^2-27*x^3-37*x^4-23*x^5-25*x^6-31*x^7-5*x^8-15*x^9 ) / ( (x-1)*(1+x)*(x^4+x^3+x^2+x+1)*(x^4-x^3+x^2-x+1) ). (End) MATHEMATICA PowerMod[3, Range[0, 50], 44] (* or *) Table[Mod[3^n, 44], {n, 0, 100}] (* G. C. Greubel, Mar 09 2016 *) PROG (PARI) a(n)=lift(Mod(3, 44)^n) \\ Charles R Greathouse IV, Mar 22 2016 CROSSREFS Sequence in context: A292390 A211219 A248959 * A027889 A018766 A036126 Adjacent sequences:  A070359 A070360 A070361 * A070363 A070364 A070365 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 | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 29 07:03 EST 2020. Contains 331337 sequences. (Running on oeis4.)