A070540 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A070540

a(n) = n^4 mod 21.

0, 1, 16, 18, 4, 16, 15, 7, 1, 9, 4, 4, 9, 1, 7, 15, 16, 4, 18, 16, 1, 0, 1, 16, 18, 4, 16, 15, 7, 1, 9, 4, 4, 9, 1, 7, 15, 16, 4, 18, 16, 1, 0, 1, 16, 18, 4, 16, 15, 7, 1, 9, 4, 4, 9, 1, 7, 15, 16, 4, 18, 16, 1, 0, 1, 16, 18, 4, 16, 15, 7, 1, 9, 4, 4, 9, 1, 7, 15, 16, 4, 18, 16, 1, 0, 1, 16, 18 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,3`
	COMMENTS	`Equivalently: n^(6*m + 4) mod 21. - G. C. Greubel, Apr 05 2016`
	LINKS	`G. C. Greubel, Table of n, a(n) for n = 0..1000`
	FORMULA	`From G. C. Greubel, Apr 05 2016: (Start)` `a(21*n) = 0.` `a(n+21) = a(n). (End)`
	MATHEMATICA	`PowerMod[Range[0, 100], 4, 21] (* G. C. Greubel, Apr 05 2016 *)`
	PROG	`(Sage) [power_mod(n, 4, 21)for n in range(0, 88)] # Zerinvary Lajos, Oct 31 2009` `(PARI) a(n)=n^4%21 \\ Charles R Greathouse IV, Apr 06 2016`
	CROSSREFS	`Sequence in context: A041542 A030046 A002925 * A341271 A085096 A043675` `Adjacent sequences: A070537 A070538 A070539 * A070541 A070542 A070543`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane, May 13 2002`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 2 10:07 EDT 2022. Contains 355004 sequences. (Running on oeis4.)