A070709 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A070709

n^7 mod 28.

0, 1, 16, 3, 4, 5, 20, 7, 8, 9, 24, 11, 12, 13, 0, 15, 16, 17, 4, 19, 20, 21, 8, 23, 24, 25, 12, 27, 0, 1, 16, 3, 4, 5, 20, 7, 8, 9, 24, 11, 12, 13, 0, 15, 16, 17, 4, 19, 20, 21, 8, 23, 24, 25, 12, 27, 0, 1, 16, 3, 4, 5, 20, 7, 8, 9, 24, 11, 12, 13, 0, 15, 16, 17, 4, 19, 20, 21, 8, 23, 24

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

LINKS

Table of n, a(n) for n=0..80.

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, 1).

PROG

(Sage) [power_mod(n, 7, 28)for n in range(0, 81)] # - Zerinvary Lajos, Oct 29 2009

(PARI) a(n)=n^7%28 \\ Charles R Greathouse IV, Apr 06 2016

CROSSREFS

Sequence in context: A080992 A040249 A099143 * A247585 A068615 A341720

Adjacent sequences: A070706 A070707 A070708 * A070710 A070711 A070712

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, May 13 2002

STATUS

approved