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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070450 a(n) = n^2 mod 28. 7
0, 1, 4, 9, 16, 25, 8, 21, 8, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 8, 21, 8, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 8, 21, 8, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 8, 21, 8, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 8, 21, 8, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 8, 21, 8, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = a(n-28). - G. C. Greubel, Mar 24 2016

MATHEMATICA

Table[Mod[n^2, 28], {n, 0, 200}] (* Vladimir Joseph Stephan Orlovsky, Apr 27 2011 *)

PROG

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

CROSSREFS

Cf. A070448, A070449.

Sequence in context: A070452 A070653 A070451 * A070449 A070448 A081403

Adjacent sequences:  A070447 A070448 A070449 * A070451 A070452 A070453

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, May 12 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 10 04:09 EST 2016. Contains 278993 sequences.