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!)
A271572 a(n) = n^7 mod 32. 0
0, 1, 0, 11, 0, 13, 0, 23, 0, 25, 0, 3, 0, 5, 0, 15, 0, 17, 0, 27, 0, 29, 0, 7, 0, 9, 0, 19, 0, 21, 0, 31, 0, 1, 0, 11, 0, 13, 0, 23, 0, 25, 0, 3, 0, 5, 0, 15, 0, 17, 0, 27, 0, 29, 0, 7, 0, 9, 0, 19, 0, 21, 0, 31, 0, 1, 0, 11, 0, 13, 0, 23, 0, 25, 0, 3, 0, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1).
FORMULA
G.f.: (x + 11*x^3 + 13*x^5 + 23*x^7 + 25*x^9 + 3*x^11 + 5*x^13 + 15*x^15 + 17*x^17 + 27*x^19 + 29*x^21 + 7*x^23 + 9*x^25 + 19*x^27 + 21*x^29 + 31*x^31)/(1-x^32).
a(n) = a(n-32).
MATHEMATICA
PowerMod[Range[0, 100], 7, 32]
PROG
(Magma) [Modexp(n, 7, 32): n in [0..100]];
(PARI) a(n) = n^7 % 32; \\ Altug Alkan, Apr 10 2016
(Python) for n in range(0, 50):print((n**7)%32) # Soumil Mandal, Apr 11 2016
CROSSREFS
Sequence in context: A088621 A088623 A167166 * A180059 A147765 A087556
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Apr 10 2016
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 July 14 11:30 EDT 2024. Contains 374318 sequences. (Running on oeis4.)