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.

A066607 a(n) = 3^n mod n^3.

This page as a plain text file.
%I A066607 #17 Dec 07 2024 14:55:44
%S A066607 0,1,0,17,118,81,129,417,0,49,124,945,1498,177,1782,1857,1958,729,
%T A066607 3917,401,7398,8721,6466,4833,68,14049,0,3889,9718,26649,24648,16001,
%U A066607 3294,6537,32457,41553,34857,33601,26703,32801,9310,62721,76070,50417,12393
%N A066607 a(n) = 3^n mod n^3.
%H A066607 Harry J. Smith, <a href="/A066607/b066607.txt">Table of n, a(n) for n = 1..1000</a>
%e A066607 a(7) = 129 as 3^7 = 2187 = (7^3)*6 + 129.
%t A066607 Table[ Mod[ 3^n, n^3], {n, 1, 50} ]
%o A066607 (Sage) [power_mod(3,n,n^3)for n in range(1,46)] # _Zerinvary Lajos_, Nov 28 2009
%o A066607 (PARI) a(n) = { lift(Mod(3, n^3)^n) } \\ _Harry J. Smith_, Mar 10 2010
%Y A066607 Cf. A066606.
%K A066607 easy,nonn
%O A066607 1,4
%A A066607 _Amarnath Murthy_, Dec 22 2001
%E A066607 More terms from _Floor van Lamoen_ and _Robert G. Wilson v_, Dec 23 2001