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.
%I A214795 #16 Nov 25 2017 09:58:50
%S A214795 2,2,5,5,10,5,9,5,17,12,2,5,6,9,13,17,8,17,11,53,9,2,4,5,30,6,45,17,7,
%T A214795 33,23,41,13,8,33,17,47,11,21,53,29,9,53,23,93,33,25,17,65,30,29,23,
%U A214795 42,45,10,17,29,21,51,53
%N A214795 a(n) is the smallest k>=2 such that n divides Fibonacci(k-1)+21.
%C A214795 The n-th entry a(n) means that a(n) is the index of the first term in A000045+21 which n divides.
%t A214795 skdf[n_]:=Module[{k=2},While[!Divisible[Fibonacci[k-1]+21,n],k++];k]; Array[ skdf,60] (* _Harvey P. Dale_, Nov 25 2017 *)
%Y A214795 Cf. A214789, A213790, A214791, A214792
%K A214795 nonn
%O A214795 1,1
%A A214795 _Art DuPre_, Aug 03 2012
%E A214795 Definition corrected. - _R. J. Mathar_, Aug 09 2012