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 A130259 #20 Sep 28 2024 14:23:08
%S A130259 0,1,1,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,
%T A130259 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,
%U A130259 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5
%N A130259 Maximal index k of an even Fibonacci number (A001906) such that A001906(k) = Fib(2k) <= n (the 'lower' even Fibonacci Inverse).
%C A130259 Inverse of the even Fibonacci sequence (A001906), since a(A001906(n))=n (see A130260 for another version).
%C A130259 a(n)+1 is the number of even Fibonacci numbers (A001906) <=n.
%H A130259 G. C. Greubel, <a href="/A130259/b130259.txt">Table of n, a(n) for n = 0..10000</a>
%F A130259 a(n) = floor(arcsinh(sqrt(5)*n/2)/(2*log(phi))), where phi=(1+sqrt(5))/2.
%F A130259 a(n) = A130260(n+1) - 1.
%F A130259 G.f.: g(x) = 1/(1-x)*Sum_{k>=1} x^Fibonacci(2*k).
%F A130259 a(n) = floor(1/2*log_phi(sqrt(5)*n+1)) for n>=0.
%e A130259 a(10)=3 because A001906(3)=8<=10, but A001906(4)=21>10.
%t A130259 Table[Floor[1/2*Log[GoldenRatio, (Sqrt[5]*n + 1)]], {n, 0, 100}] (* _G. C. Greubel_, Sep 12 2018 *)
%o A130259 (PARI) vector(100, n, n--; floor(log((sqrt(5)*n+1))/(2*log((1+sqrt(5))/2) ))) \\ _G. C. Greubel_, Sep 12 2018
%o A130259 (Magma) [Floor(Log((Sqrt(5)*n+1))/(2*Log((1+Sqrt(5))/2))): n in [0..100]]; // _G. C. Greubel_, Sep 12 2018
%Y A130259 Cf. partial sums A130261. Other related sequences: A000045, A001519, A130233, A130237, A130239, A130255, A130260, A104160. Lucas inverse: A130241 - A130248.
%K A130259 nonn
%O A130259 0,4
%A A130259 _Hieronymus Fischer_, May 25 2007, Jul 02 2007