A094402 -id:A094402 - cp's OEIS frontend

A094400 Odd n dividing Fibonacci(n)-1 but neither Fibonacci(n-1) nor Fibonacci(n+1).

7743, 27071, 54839, 72831, 217257, 388367, 417601, 575599, 670879, 691447, 701569, 809999, 850541, 881011, 1274897, 1365407, 1383249, 1464449, 1504097, 1653751, 1922817, 2106017, 2276351, 2385811, 2474047, 2556553, 2628879, 2697899, 2804543, 3017729, 3352049

Offset: 1

Eric Rowland, May 01 2004

nonn

Giovanni Resta, Table of n, a(n) for n = 1..559 (terms < 4*10^9)

Cf. A069106, A069107, A094394, A094401, A094402.

Select[Range[50000], OddQ[ # ] && Mod[Fibonacci[ # ] - 1, # ] == 0 && ! Mod[Fibonacci[ # - 1], # ] == 0 && ! Mod[Fibonacci[ # + 1], # ] == 0 &]

Offset corrected by and a(15)-a(31) from Giovanni Resta, Jul 20 2013

A094398 Numbers k that divide Lucas(k) + 1.

Original entry on oeis.org

1, 2, 4, 8, 15, 16, 32, 64, 128, 256, 323, 368, 512, 736, 1024, 1472, 2048, 2944, 4096, 4879, 5655, 5888, 6479, 7055, 8192, 8464, 9879, 10815, 11663, 11776, 12935, 16384, 16928, 18407, 19043, 23407, 23552, 31535, 32768, 33856, 34943, 35207, 35296

Offset: 1

Eric Rowland, May 01 2004

nonn

The powers of 2 (A000079) are in the sequence. - Michel Lagneau, Feb 09 2015

Giovanni Resta, Table of n, a(n) for n = 1..1000

Cf. A000079, A000204, A005845, A094402.

Select[Range[40000],Divisible[LucasL[#]+1,#]&]  (* Harvey P. Dale, Apr 13 2011 *)

is(n)=(Mod([0,1;1,1],n)^n*[2;1])[1,1]==-1 \\ Charles R Greathouse IV, Nov 04 2016

cp's OEIS Frontend

A094400 Odd n dividing Fibonacci(n)-1 but neither Fibonacci(n-1) nor Fibonacci(n+1).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Extensions