Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070697
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070697 n^7 mod 15. +0
1
0, 1, 8, 12, 4, 5, 6, 13, 2, 9, 10, 11, 3, 7, 14, 0, 1, 8, 12, 4, 5, 6, 13, 2, 9, 10, 11, 3, 7, 14, 0, 1, 8, 12, 4, 5, 6, 13, 2, 9, 10, 11, 3, 7, 14, 0, 1, 8, 12, 4, 5, 6, 13, 2, 9, 10, 11, 3, 7, 14, 0, 1, 8, 12, 4, 5, 6, 13, 2, 9, 10, 11, 3, 7, 14, 0, 1, 8, 12, 4, 5, 6, 13, 2, 9, 10, 11, 3, 7, 14 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n)=A070477(n). [Proof: (n^7-n^3) == 0 (mod 15) is shown for n=0 to 14 explicitly. Then binomial expansion of (n+15)^7 and (n+15)^3 extend this by induction n->n+15 to all other indices.] [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 30 2009]

CROSSREFS

Sequence in context: A126814 A037449 A070477 this_sequence A004473 A114404 A033198

Adjacent sequences: A070694 A070695 A070696 this_sequence A070698 A070699 A070700

KEYWORD

nonn,new

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research