login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
FORMULA
From R. J. Mathar, 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
Cf. A000244.
Sequence in context: A292390 A211219 A248959 * A027889 A360423 A018766
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)