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.
%I A070697 #18 Dec 27 2023 15:10:13
%S A070697 0,1,8,12,4,5,6,13,2,9,10,11,3,7,14,0,1,8,12,4,5,6,13,2,9,10,11,3,7,
%T A070697 14,0,1,8,12,4,5,6,13,2,9,10,11,3,7,14,0,1,8,12,4,5,6,13,2,9,10,11,3,
%U A070697 7,14,0,1,8,12,4,5,6,13,2,9,10,11,3,7,14,0,1,8,12,4,5,6,13,2,9,10,11,3,7,14
%N A070697 Duplicate of A070477.
%C A070697 a(n)=A070477(n). [Proof: (n^7-n^3) == 0 (mod 15) is shown for n=0 to 14 explicitly. Then binomial expansion of (n+15)^7 and (n+15)^3 extend this by induction n->n+15 to all other indices.] - _R. J. Mathar_, Oct 30 2009
%t A070697 Table[Mod[n^3, 15], {n, 0, 100}] (* _Vincenzo Librandi_, Jun 19 2014 *)
%o A070697 (Magma) [n^3 mod 15: n in [0..80]]; // _Vincenzo Librandi_, Jun 19 2014
%o A070697 (PARI) a(n)=n^7%15 \\ _Charles R Greathouse IV_, Apr 06 2016
%Y A070697 Cf. A008960.
%K A070697 dead
%O A070697 0,3
%A A070697 _N. J. A. Sloane_, May 13 2002