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 A185381 #29 Jan 11 2022 15:01:47
%S A185381 0,1,2,3,8,21,34,89,144,377,987,1597,4181,10946,17711,46368,75025,
%T A185381 196418,514229,832040,2178309,3524578,9227465,24157817,39088169,
%U A185381 102334155,267914296,433494437,1134903170,1836311903,4807526976,12586269025,20365011074,53316291173,139583862445,225851433717,591286729879,956722026041,2504730781961,6557470319842
%N A185381 a(n) = Fibonacci(k) where k = floor( n*(1+sqrt(5))/2 ).
%C A185381 Another version of A107858.
%H A185381 G. C. Greubel, <a href="/A185381/b185381.txt">Table of n, a(n) for n = 0..1000</a>
%F A185381 a(n) = A000045(A000201(n)). - _Michel Marcus_, Jan 11 2022
%t A185381 Table[Fibonacci[Floor[n*GoldenRatio]],{n,0,50}] (* _Harvey P. Dale_, May 24 2016 *)
%o A185381 (PARI) for(n=0,50, print1(fibonacci(floor(n*(1+sqrt(5))/2)), ", ")) \\ _G. C. Greubel_, Jun 28 2017
%o A185381 (Python)
%o A185381 from math import isqrt
%o A185381 from sympy import fibonacci
%o A185381 def A185381(n): return fibonacci((n+isqrt(5*n**2))//2) # _Chai Wah Wu_, Jan 11 2022
%Y A185381 Cf. A000045, A000201, A107858.
%K A185381 nonn
%O A185381 0,3
%A A185381 _N. J. A. Sloane_, May 06 2012