Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)
A070661 a(n) = n^6 mod 38. 0
0, 1, 26, 7, 30, 7, 30, 1, 20, 11, 30, 1, 20, 11, 26, 11, 26, 7, 20, 19, 20, 7, 26, 11, 26, 11, 20, 1, 30, 11, 20, 1, 30, 7, 30, 7, 26, 1, 0, 1, 26, 7, 30, 7, 30, 1, 20, 11, 30, 1, 20, 11, 26, 11, 26, 7, 20, 19, 20, 7, 26, 11, 26, 11, 20, 1, 30, 11, 20, 1, 30, 7, 30, 7, 26, 1, 0, 1, 26 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
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, 0, 0, 0, 0, 0, 0, 1).
FORMULA
a(n) = a(n-38). - Wesley Ivan Hurt, Dec 26 2023
MATHEMATICA
PowerMod[Range[0, 80], 6, 38] (* Harvey P. Dale, Feb 12 2013 *)
PROG
(Sage) [power_mod(n, 6, 38)for n in range(0, 79)] # Zerinvary Lajos, Nov 07 2009
(PARI) a(n)=n^6%38 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A277215 A331481 A040656 * A040655 A163987 A163989
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 August 21 15:15 EDT 2024. Contains 375353 sequences. (Running on oeis4.)