cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A070453 a(n) = n^2 mod 31.

This page as a plain text file.
%I A070453 #14 Dec 18 2023 12:48:27
%S A070453 0,1,4,9,16,25,5,18,2,19,7,28,20,14,10,8,8,10,14,20,28,7,19,2,18,5,25,
%T A070453 16,9,4,1,0,1,4,9,16,25,5,18,2,19,7,28,20,14,10,8,8,10,14,20,28,7,19,
%U A070453 2,18,5,25,16,9,4,1,0,1,4,9,16,25,5,18,2,19,7,28,20,14,10,8,8,10,14,20
%N A070453 a(n) = n^2 mod 31.
%H A070453 G. C. Greubel, <a href="/A070453/b070453.txt">Table of n, a(n) for n = 0..1000</a>
%H A070453 <a href="/index/Rec#order_31">Index entries for linear recurrences with constant coefficients</a>, 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, 0, 0, 0, 1).
%F A070453 a(n) = a(n-31). - _G. C. Greubel_, Mar 24 2016
%t A070453 Table[Mod[n^2,31],{n,0,200}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 27 2011 *)
%o A070453 (PARI) a(n)=n^2%31 \\ _Charles R Greathouse IV_, Apr 06 2016
%Y A070453 Cf. A070450, A070451.
%K A070453 nonn,easy
%O A070453 0,3
%A A070453 _N. J. A. Sloane_, May 12 2002