id:A070638 - OEIS Search Results

Search: id:A070638

Displaying 1-1 of 1 results found.

page 1

n^6 mod 15.

+0
1

0, 1, 4, 9, 1, 10, 6, 4, 4, 6, 10, 1, 9, 4, 1, 0, 1, 4, 9, 1, 10, 6, 4, 4, 6, 10, 1, 9, 4, 1, 0, 1, 4, 9, 1, 10, 6, 4, 4, 6, 10, 1, 9, 4, 1, 0, 1, 4, 9, 1, 10, 6, 4, 4, 6, 10, 1, 9, 4, 1, 0, 1, 4, 9, 1, 10, 6, 4, 4, 6, 10, 1, 9, 4, 1, 0, 1, 4, 9, 1, 10, 6, 4, 4, 6, 10, 1, 9, 4, 1, 0, 1, 4, 9, 1, 10, 6 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`a(n)=A070438(n) [Proof: n^6-n^2 =0 (mod 15) is shown explicitly for n=0 to 14, then the induction n->n+15 for the 6th order polynomial followed by binomial expansion of (n+15)^k concludes that the zero (mod 15) is periodically extended to the other integers.] [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 23 2009]`
	PROGRAM	`(Other) sage: [power_mod(n, 6, 15)for n in xrange(0, 97)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 06 2009]`
	CROSSREFS	`Sequence in context: A120865 A133868 A070438 this_sequence A152205 A129861 A055491` `Adjacent sequences: A070635 A070636 A070637 this_sequence A070639 A070640 A070641`
	KEYWORD	`nonn,new`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), May 13 2002`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research