[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!)
Revision History for A354443 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A354443 a(n) = Fibonacci(n^n) mod n.
(history; published version)
#32 by Alois P. Heinz at Fri Jun 03 09:25:16 EDT 2022
STATUS

editing

approved

#31 by Alois P. Heinz at Fri Jun 03 09:25:13 EDT 2022
KEYWORD

nonn,look,new

STATUS

approved

editing

#30 by Alois P. Heinz at Fri Jun 03 09:24:48 EDT 2022
STATUS

proposed

approved

#29 by Chai Wah Wu at Fri Jun 03 09:07:15 EDT 2022
STATUS

editing

proposed

#28 by Chai Wah Wu at Fri Jun 03 09:07:01 EDT 2022
LINKS

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

STATUS

approved

editing

#27 by Michel Marcus at Wed Jun 01 02:00:48 EDT 2022
STATUS

reviewed

approved

#26 by Joerg Arndt at Wed Jun 01 01:59:01 EDT 2022
STATUS

proposed

reviewed

#25 by Chai Wah Wu at Tue May 31 23:10:23 EDT 2022
STATUS

editing

proposed

#24 by Chai Wah Wu at Tue May 31 23:10:08 EDT 2022
PROG

def A354443(n): return fibonacci(pow(n**, n % , A001175(n)) % ))) % n # Chai Wah Wu, May 31 2022

STATUS

proposed

editing

#23 by Chai Wah Wu at Tue May 31 22:59:08 EDT 2022
STATUS

editing

proposed

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.)