cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A159051 Numbers n such that Fibonacci(n-2) is divisible by n.

Original entry on oeis.org

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
Offset: 1

Views

Author

Keywords

Examples

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

Crossrefs

Programs

  • 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
    
  • 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 *)
  • PARI
    is(n)=((Mod([1,1;1,0],n))^(n-2))[1,2]==0 \\ Charles R Greathouse IV, Feb 03 2014