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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070452 n^2 mod 30. 10
0, 1, 4, 9, 16, 25, 6, 19, 4, 21, 10, 1, 24, 19, 16, 15, 16, 19, 24, 1, 10, 21, 4, 19, 6, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 6, 19, 4, 21, 10, 1, 24, 19, 16, 15, 16, 19, 24, 1, 10, 21, 4, 19, 6, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 6, 19, 4, 21, 10, 1, 24, 19, 16, 15, 16, 19, 24, 1 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

a(m*n)=a(m)*a(n) mod 30; a(15*n+k)=a(15*n-k) for k<=15*n; a(n+30)=a(n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 24 2009]

FORMULA

a(n)= -a(n-1) +a(n-3) +a(n-4) -a(n-6) -a(n-7) +a(n-9) +a(n-10) -a(n-12) -a(n-13) +a(n-15) +a(n-16) -a(n-18) -a(n-19) +a(n-21) +a(n-22) -a(n-24) -a(n-25) +a(n-27) +a(n-28). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 23 2009]

MATHEMATICA

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

PROG

(Other) sage: [power_mod(n, 2, 30)for n in xrange(0, 75)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 03 2009]

CROSSREFS

A010462, A070431, A008959, A070435, A070438, A070442, A159852, A000290. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 24 2009]

Sequence in context: A070454 A070453 * A070653 A070451 A070450 A070449

Adjacent sequences:  A070449 A070450 A070451 * A070453 A070454 A070455

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), May 12 2002

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

Content is available under The OEIS End-User License Agreement .

Last modified February 16 19:48 EST 2012. Contains 205955 sequences.