A299155
Numbers i such that Fibonacci(i) is divisible by i+k for k=0..6.
Original entry on oeis.org
329400, 175472640, 808214400, 1367566200, 1928871000, 3433706640, 16109533440, 16916445000, 17847413640, 19507068000, 23163310800, 24961167000, 32645743200, 37263088800, 39803400000, 44915270400, 50238568800, 66072283200, 81924990840, 85368457440
Offset: 1
-
fibomod(n,m) = lift(Mod([0,1;1,1],m)^(n+1))[1,1];
isok(n) = prod(k=0,6,fibomod(n,n+k)==0); \\ Silvester Resnik, May 18 2018
A298688
a(n) is the least i such that Fibonacci(i) is divisible by i+k for all k=0..n.
Original entry on oeis.org
1, 60, 60, 540, 13440, 13440, 329400, 175472640, 50238568800
Offset: 0
Least i such that Fibonacci(i) is divisible by i and i+1 (cf. A217738) is i=60, therefore a(1)=60.
Least i such that Fibonacci(i) is divisible by i, i+1, ..., i+5 (cf. A298687) is i=13440, therefore a(5)=13440.
A300555
Numbers i such that Fibonacci(i) is divisible by i+k for k = 0..7.
Original entry on oeis.org
175472640, 44915270400, 50238568800, 439287521400, 572836904640, 589596638400, 735284012400, 778042465200, 987189789600, 1261551677400, 1297640010240, 1307130728400, 1569978804240, 1979830125000, 2705598768600
Offset: 1
-
fibomod(n, m) = lift(Mod([0, 1; 1, 1], m)^(n+1))[1, 1];
isok(n) = prod(k=0, 7, fibomod(n, n+k)==0);
A303585
Numbers i such that Fibonacci(i) is divisible by i+k for k = 0..8.
Original entry on oeis.org
50238568800, 5824121940000, 46919196354240, 50564131254000, 80493123110400, 195778384956000, 307148642236800, 799863695270640
Offset: 1
Cf.
A000045,
A023172,
A217738,
A221018,
A225219,
A298684,
A298685,
A298686,
A298687,
A298688,
A299155.
-
fibomod(n, m) = lift(Mod([0, 1; 1, 1], m)^(n+1))[1, 1];
isok(n) = prod(k=0, 8, fibomod(n, n+k)==0);
Showing 1-4 of 4 results.
Comments