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!)
A167624 a(n) = n^6 mod 32. 1
0, 1, 0, 25, 0, 9, 0, 17, 0, 17, 0, 9, 0, 25, 0, 1, 0, 1, 0, 25, 0, 9, 0, 17, 0, 17, 0, 9, 0, 25, 0, 1, 0, 1, 0, 25, 0, 9, 0, 17, 0, 17, 0, 9, 0, 25, 0, 1, 0, 1, 0, 25, 0, 9, 0, 17, 0, 17, 0, 9, 0, 25, 0, 1, 0, 1, 0, 25, 0, 9, 0, 17, 0, 17, 0, 9, 0, 25, 0, 1, 0, 1, 0, 25, 0, 9, 0, 17, 0, 17, 0, 9, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Equivalently: n^(8*m+6) (mod 32). - G. C. Greubel, Jun 17 2016
LINKS
FORMULA
a(n+16) = a(n). - G. C. Greubel, Jun 17 2016
From Chai Wah Wu, Jan 06 2020: (Start)
a(n) = a(n-2) - a(n-4) + a(n-6) - a(n-8) + a(n-10) - a(n-12) + a(n-14) for n > 13.
G.f.: (-x^13 - 24*x^11 + 15*x^9 - 32*x^7 + 15*x^5 - 24*x^3 - x)/((x - 1)*(x + 1)*(x^4 + 1)*(x^8 + 1)). (End)
MATHEMATICA
PowerMod[Range[0, 100], 6, 32] (* Harvey P. Dale, Apr 03 2015 *)
PROG
(Sage) [power_mod(n, 6, 32) for n in range(0, 100)] #
(PARI) a(n)=n^6%32 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A068741 A255403 A005079 * A181614 A108321 A059062
KEYWORD
nonn,easy
AUTHOR
Zerinvary Lajos, Nov 07 2009
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 27 18:09 EDT 2024. Contains 372020 sequences. (Running on oeis4.)