[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A354443 a(n) = Fibonacci(n^n) mod n. 1

%I #32 Jun 03 2022 09:25:16

%S 0,1,2,3,0,0,6,3,7,5,1,0,12,7,10,11,16,0,1,15,5,3,22,0,0,3,20,7,1,0,1,

%T 27,13,1,5,0,36,3,25,35,1,0,42,19,20,21,46,0,36,25,17,3,52,0,5,35,34,

%U 1,1,0,1,3,43,59,15,30,66,35,44,35,1,0,72,3,50,3,2,60,1,75,7

%N a(n) = Fibonacci(n^n) mod n.

%H Chai Wah Wu, <a href="/A354443/b354443.txt">Table of n, a(n) for n = 1..10000</a>

%o (PARI)

%o fibmod(n,m) = lift(((Mod([1,1;1,0], m))^n)[1,2]); \\ as from A001175

%o a(n) = fibmod(n^n,n);

%o (Python)

%o # uses A001175 python function from A001175

%o from sympy import fibonacci

%o def A354443(n): return fibonacci(pow(n,n,A001175(n))) % n # _Chai Wah Wu_, May 31 2022

%Y Cf. A000045, A002708, A001175.

%K nonn,look

%O 1,3

%A _Chittaranjan Pardeshi_, May 29 2022

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 04:38 EDT 2024. Contains 375526 sequences. (Running on oeis4.)