The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A309578 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A309578

Multiplicative inverse of Fibonacci(prime(n)) modulo Fibonacci(prime(n+1)).
(history; published version)

#17 by N. J. A. Sloane at Wed Aug 28 12:53:20 EDT 2019

STATUS

proposed

approved

#16 by Michel Marcus at Tue Aug 13 06:15:26 EDT 2019

STATUS

editing

proposed

Discussion

Sun Aug 18

00:06

Dragos Ristache: What does CF mean? I added more terms btw, is there anything else I need to do?

Wed Aug 28

12:53

N. J. A. Sloane: Cf is Latin, "compare", confer

#15 by Michel Marcus at Tue Aug 13 06:15:19 EDT 2019

CROSSREFS

Cf. A000045, A030426, A069830.

STATUS

proposed

editing

#14 by Alois P. Heinz at Mon Aug 12 16:54:17 EDT 2019

STATUS

editing

proposed

#13 by Alois P. Heinz at Mon Aug 12 16:50:48 EDT 2019

FORMULA

a(n) = invmod(Fibonacci(prime(in)), Fibonacci(prime(in+1)).

#12 by Alois P. Heinz at Mon Aug 12 16:49:54 EDT 2019

FORMULA

a(n) = invmod(fibFibonacci(prime(i)), fibFibonacci(prime(i+1)).

MAPLE

a:= n-> (f-> (1/f(n) mod f(n+1)))(j->combinat[fibonacci](ithprime(j))):

seq(a(n), n=1..25); # Alois P. Heinz, Aug 12 2019

#11 by Alois P. Heinz at Mon Aug 12 16:48:52 EDT 2019

NAME

Multiplicative inverse of FibFibonacci(prime(n)) modulo FibFibonacci(prime(n+1)).

COMMENTS

Since Fibonacci numbers have the property that GCDgcd(x,y) = GCDgcd(fibFibonacci(x), fibFibonacci(y)), the modular inverse will always exist for this sequence.

#10 by Alois P. Heinz at Mon Aug 12 16:47:15 EDT 2019

NAME

Multiplicative inverse of Fib(prime(n)) modulo Fib(prime(n+1)).

FORMULA

a(n) = invmod(fib(prime(i)), fib(prime(i+1)).

STATUS

proposed

editing

#9 by Michel Marcus at Mon Aug 12 16:41:13 EDT 2019

STATUS

editing

proposed

#8 by Michel Marcus at Mon Aug 12 16:40:58 EDT 2019

CROSSREFS

Cf. A000045, A069830.

STATUS

proposed

editing

Discussion

Mon Aug 12

16:41

Michel Marcus: ok ?