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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070486 a(n) = n^3 mod 24 (or equivalently, n^5 mod 24). 1
0, 1, 8, 3, 16, 5, 0, 7, 8, 9, 16, 11, 0, 13, 8, 15, 16, 17, 0, 19, 8, 21, 16, 23, 0, 1, 8, 3, 16, 5, 0, 7, 8, 9, 16, 11, 0, 13, 8, 15, 16, 17, 0, 19, 8, 21, 16, 23, 0, 1, 8, 3, 16, 5, 0, 7, 8, 9, 16, 11, 0, 13, 8, 15, 16, 17, 0, 19, 8, 21, 16, 23, 0, 1, 8, 3, 16, 5, 0, 7, 8, 9, 16, 11, 0, 13 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Equivalently, n^7 mod 24. [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 29 2009]

PROG

(Other) 1. sage: [power_mod(n, 3, 24)for n in xrange(0, 86)] # 2. sage: [power_mod(n, 5, 24)for n in xrange(0, 86)] # 3. sage: [power_mod(n, 7, 24)for n in xrange(0, 86)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 29 2009]

CROSSREFS

Sequence in context: A069200 A069218 A070608 * A195161 A144433 A037206

Adjacent sequences:  A070483 A070484 A070485 * A070487 A070488 A070489

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), May 12 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 12:41 EST 2012. Contains 205909 sequences.