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 A128162 #16 Jun 12 2021 23:38:51
%S A128162 0,0,1,0,3,1,3,9,31,34,37,81,137,347,487,690,355,1369,2001,1926,5331,
%T A128162 1369,4823,8289,74043,77951,188571,284781,490766,166409,1333373,
%U A128162 1803615,1516839,914943,3619092,3987873,17604245,8506938,57277423,24741861
%N A128162 a(n) = 3^n modulo Fibonacci(n).
%C A128162 Numbers k such that a(k) is prime are listed in A128163. Corresponding primes in {a(n)} are {3, 3, 31, 37, 137, 347, 487, 77951, 166409, 13506083561, ...}.
%H A128162 Robert Israel, <a href="/A128162/b128162.txt">Table of n, a(n) for n = 1..4783</a>
%p A128162 f:= n -> 3 &^ n mod combinat:-fibonacci(n):
%p A128162 map(f, [$1..100]); # _Robert Israel_, Jul 10 2020
%t A128162 Table[PowerMod[3,n,Fibonacci[n]],{n,1,100}]
%o A128162 (Sage) [power_mod(3,n,fibonacci(n))for n in range(1,41)] # - _Zerinvary Lajos_, Nov 28 2009
%o A128162 (PARI) a(n)=3^n%fibonacci(n) \\ _Charles R Greathouse IV_, Jun 19 2017
%Y A128162 Cf. A128163, A128161, A057862 (2^n modulo Fibonacci(n)).
%K A128162 nonn
%O A128162 1,5
%A A128162 _Alexander Adamchuk_, Feb 19 2007