|
|
A309578
|
|
Multiplicative inverse of Fibonacci(prime(n)) modulo Fibonacci(prime(n+1)).
|
|
0
|
|
|
1, 3, 8, 48, 144, 329, 2584, 15456, 104005, 832040, 1866294, 34111385, 267914296, 1602508992, 10783446409, 193501094490, 1548008755920, 3472236254411, 166151337293088, 498454011879264, 1118049290473933, 53500214605455696, 360008399296352015, 2460986135945634432
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Since Fibonacci numbers have the property that gcd(x,y) = gcd(Fibonacci(x), Fibonacci(y)), the modular inverse will always exist for this sequence.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = invmod(Fibonacci(prime(n)), Fibonacci(prime(n+1)).
|
|
MAPLE
|
a:= n-> (f-> (1/f(n) mod f(n+1)))(j->combinat[fibonacci](ithprime(j))):
|
|
MATHEMATICA
|
Table[ModularInverse[Fibonacci[Prime[n]], Fibonacci[Prime[n+1]]], {n, 20}]
|
|
PROG
|
(PARI) a(n)={lift(1/(Mod(fibonacci(prime(n)), fibonacci(prime(n+1)))))} \\ Andrew Howroyd, Aug 12 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|