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 A253109 #16 Sep 08 2022 08:46:10
%S A253109 1,2,9,64,1,36,117649,32768,4782969,100000,11,1,23298085122481,
%T A253109 793714773254144,576650390625,17592186044416,48661191875666868481,
%U A253109 3570467226624,19,3200000,4084101,22,907846434775996175406740561329,1,1,236773830007967588876795164938469376
%N A253109 a(n) = n ^ (Fibonacci(n) mod n).
%C A253109 a(n) = 1 for n in A023172. a(n) = n for n in A023173. - _Robert Israel_, Dec 28 2014
%e A253109 a(3) = 9, since 3^(Fibonacci(3) mod 3) = 3^(2 mod 3) = 3^2 = 9.
%e A253109 a(7) = 117649, since 7^(Fibonacci(7) mod 7) = 7^(13 mod 7) = 7^6 = 117649.
%p A253109 seq(n ^ (combinat:-fibonacci(n) mod n), n=1 .. 50); # _Robert Israel_, Dec 28 2014
%t A253109 Table[n ^ Mod[Fibonacci[n], n], {n, 29}]
%o A253109 (PARI) a(n)=n^(fibonacci(n)%n) \\ _Charles R Greathouse IV_, Feb 02 2015
%o A253109 (Magma) [n^(Fibonacci(n) mod n): n in [1..30]]; // _Vincenzo Librandi_, Feb 03 2015
%Y A253109 Cf. A000045, A002708, A023172, A023173, A168041.
%K A253109 nonn,easy
%O A253109 1,2
%A A253109 _Carlos Eduardo Olivieri_, Dec 26 2014