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

 

Logo


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

0,3

LINKS

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

Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

FORMULA

G.f.: -x*(1 +4*x +9*x^2 +2*x^3 +11*x^4 +8*x^5 +7*x^6 +8*x^7 +11*x^8 +2*x^9 +9*x^10 +4*x^11 +x^12) / ((x-1)*(1+x^6+x^5+x^4+x^3+x^2+x)*(1+x)*(1-x+x^2-x^3+x^4-x^5+x^6)). - R. J. Mathar, Jul 27 2015

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

MATHEMATICA

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

PowerMod[Range[0, 100], 2, 14] (* Harvey P. Dale, Dec 02 2014 *)

PROG

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

CROSSREFS

Cf. A070434, A070435, A070436.

Sequence in context: A277526 A196505 A203816 * A238324 A128204 A079049

Adjacent sequences:  A070434 A070435 A070436 * A070438 A070439 A070440

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 14:52 EDT 2019. Contains 328161 sequences. (Running on oeis4.)