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 A067007 #13 Feb 16 2025 08:32:45
%S A067007 0,0,1,0,0,4,4,0,1,0,1,4,3,4,10,0,1,10,9,0,4,12,13,16,0,16,10,4,24,10,
%T A067007 5,0,1,18,25,28,10,28,16,0,1,4,24,12,10,36,9,16,4,0,1,16,46,10,45,32,
%U A067007 28,24,48,40,47,36,46,0,55,34,10,52,13,60,45,64,1,10,25,28,67,16,52,0
%N A067007 a(n) = googolplex (mod n).
%C A067007 A googolplex is 10^(10^100). a(n) = 0 iff n = 2^a * 5^b, a, b >= 0 (A003592).
%H A067007 Daniel Starodubtsev, <a href="/A067007/b067007.txt">Table of n, a(n) for n = 1..10000</a>
%H A067007 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Googolplex.html">Googolplex</a>
%t A067007 Table[ PowerMod[10, 10^100, n], {n, 2, 50}]
%Y A067007 Cf. A066298.
%K A067007 nonn
%O A067007 1,6
%A A067007 _Ed Pegg Jr_, Nov 20 2002
%E A067007 Edited by _Robert G. Wilson v_, Nov 23 2002