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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A167624 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

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

FORMULA

a(n+16) = a(n). - G. C. Greubel, Jun 17 2016

MATHEMATICA

PowerMod[Range[0, 100], 6, 32] (* Harvey P. Dale, Apr 03 2015 *)

PROG

(Sage) [power_mod(n, 6, 32) for n in xrange(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

Adjacent sequences:  A167621 A167622 A167623 * A167625 A167626 A167627

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 17:46 EDT 2019. Contains 327273 sequences. (Running on oeis4.)