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!)
A070659 a(n) = n^6 mod 36. 0
0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1, 0, 1, 28, 9, 28, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
From Wesley Ivan Hurt, Dec 26 2023: (Start)
a(n) = (67+45*(-1)^n-72*cos(n*Pi/3)-40*cos(2*Pi*n/3))/6.
G.f.: x*(1+28*x+9*x^2+28*x^3+x^4)/(1-x^6).
a(n) = a(n-6). (End)
MATHEMATICA
PowerMod[Range[0, 100], 6, 36] (* Wesley Ivan Hurt, Dec 26 2023 *)
PROG
(Sage) [power_mod(n, 6, 36) for n in range(90)] # Zerinvary Lajos, Nov 07 2009
(PARI) a(n)=n^6%36 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A300563 A040762 A040761 * A040760 A179066 A033970
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 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 16:52 EDT 2024. Contains 371962 sequences. (Running on oeis4.)