login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159051 Numbers n such that Fibonacci(n-2) is divisible by n. 8
2, 8, 38, 62, 122, 158, 218, 278, 302, 362, 398, 422, 458, 482, 542, 662, 698, 758, 818, 842, 878, 884, 902, 998, 1037, 1082, 1142, 1157, 1202, 1238, 1262, 1322, 1382, 1418, 1478, 1502, 1538, 1622, 1658, 1718, 1838, 1982, 2018, 2042, 2078, 2102, 2138 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000

EXAMPLE

8=8/8=1, 38=14930352/38=392904, 62=1548008755920/62=24967883160, ...

MATHEMATICA

lst={}; Do[If[Mod[(Fibonacci[n-2]), n]==0, AppendTo[lst, n]], {n, 7!}]; lst

Select[Range[2, 2200], Divisible[Fibonacci[#-2], #]&] (* Harvey P. Dale, Dec 20 2014 *)

PROG

(Haskell)

import Data.List (elemIndices)

a159051 n = a159051_list !! (n-1)

a159051_list = map (+ 2) $ elemIndices 0 $ zipWith mod a000045_list [2..]

-- Reinhard Zumkeller, Oct 13 2011

(PARI) is(n)=((Mod([1, 1; 1, 0], n))^(n-2))[1, 2]==0 \\ Charles R Greathouse IV, Feb 03 2014

CROSSREFS

Cf. A123976, A000045, A023172, A069104.

Sequence in context: A317873 A289316 A020130 * A053520 A202744 A112738

Adjacent sequences:  A159048 A159049 A159050 * A159052 A159053 A159054

KEYWORD

nonn

AUTHOR

Vladimir Joseph Stephan Orlovsky, Apr 03 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 23 03:04 EDT 2020. Contains 337291 sequences. (Running on oeis4.)