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.

A325174 a(n) = Fibonacci(n)^n mod prime(n).

This page as a plain text file.
%I A325174 #17 Sep 08 2022 08:46:24
%S A325174 1,1,3,4,1,12,4,9,19,5,27,10,30,36,46,16,27,34,58,32,9,62,2,1,53,92,
%T A325174 30,35,76,52,9,4,70,81,105,59,61,90,82,139,19,29,28,81,92,1,121,34,
%U A325174 155,165,1,36,178,103,230,50,266,106,135,222,272,4,72,253,182,308,20,32,166,206
%N A325174 a(n) = Fibonacci(n)^n mod prime(n).
%H A325174 Vincenzo Librandi, <a href="/A325174/b325174.txt">Table of n, a(n) for n = 1..10000</a>
%p A325174 a:= n-> ((<<0|1>, <1|1>>^n)[2, 1]) &^n mod ithprime(n):
%p A325174 seq(a(n), n=1..100);  # _Alois P. Heinz_, Apr 15 2019
%t A325174 Table[PowerMod[Fibonacci[n], n, Prime[n]], {n, 70}]
%o A325174 (Magma) [Modexp(Fibonacci(n), n, NthPrime(n)): n in [1..70]];
%o A325174 (PARI) a(n) = lift(Mod(fibonacci(n), prime(n))^n); \\ _Michel Marcus_, Apr 16 2019
%Y A325174 Cf. A000040, A000045, A072123, A100399.
%K A325174 nonn,look
%O A325174 1,3
%A A325174 _Vincenzo Librandi_, Apr 15 2019