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!)
A167465 a(n) = n^5 mod 16. 1
0, 1, 0, 3, 0, 5, 0, 7, 0, 9, 0, 11, 0, 13, 0, 15, 0, 1, 0, 3, 0, 5, 0, 7, 0, 9, 0, 11, 0, 13, 0, 15, 0, 1, 0, 3, 0, 5, 0, 7, 0, 9, 0, 11, 0, 13, 0, 15, 0, 1, 0, 3, 0, 5, 0, 7, 0, 9, 0, 11, 0, 13, 0, 15, 0, 1, 0, 3, 0, 5, 0, 7, 0, 9, 0, 11, 0, 13, 0, 15, 0, 1, 0, 3, 0, 5, 0, 7, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
a(n) = a(n-16). G.f. -x*(1+3*x^2+5*x^4+7*x^6+9*x^8+11*x^10+13*x^12+15*x^14) / ( (x-1)*(1+x)*(1+x^2)*(1+x^4)*(1+x^8) ). - R. J. Mathar, Jun 28 2011
MATHEMATICA
PowerMod[Range[0, 90], 5, 16] (* Harvey P. Dale, Sep 26 2012 *)
PROG
(Sage) [power_mod(n, 5, 16)for n in range(0, 89)] #
(PARI) a(n)=n^5%16 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A109753 A318517 A245494 * A193356 A347347 A071649
KEYWORD
nonn,easy
AUTHOR
Zerinvary Lajos, Nov 04 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 August 8 11:12 EDT 2024. Contains 375021 sequences. (Running on oeis4.)