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!)
A070508 a(n) = n^3 mod 46. 1
0, 1, 8, 27, 18, 33, 32, 21, 6, 39, 34, 43, 26, 35, 30, 17, 2, 37, 36, 5, 42, 15, 22, 23, 24, 31, 4, 41, 10, 9, 44, 29, 16, 11, 20, 3, 12, 7, 40, 25, 14, 13, 28, 19, 38, 45, 0, 1, 8, 27, 18, 33, 32, 21, 6, 39, 34, 43, 26, 35, 30, 17, 2, 37, 36, 5, 42, 15, 22, 23, 24, 31, 4, 41 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Equivalently: n^(22*m + 3) mod 46. - G. C. Greubel, Mar 31 2016
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, 0, 0, 0, 0, 0, 0, 0, 0, 1).
FORMULA
a(n) = a(n-46). - G. C. Greubel, Mar 31 2016
MATHEMATICA
PowerMod[Range[0, 80], 3, 46] (* Bruno Berselli, Mar 31 2016 *)
PROG
(Sage) [power_mod(n, 3, 46) for n in range(0, 74)] # Zerinvary Lajos, Oct 30 2009
(Magma) [Modexp(n, 3, 46): n in [0..80]]; // Bruno Berselli, Mar 31 2016
(PARI) a(n)=n^3%46 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A224787 A361264 A070509 * A070507 A070506 A070505
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 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 April 19 08:28 EDT 2024. Contains 371782 sequences. (Running on oeis4.)