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 A104162 #27 Nov 04 2024 12:49:19
%S A104162 1,2,1,1,0,1,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,
%T A104162 1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,
%U A104162 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1
%N A104162 Indicator sequence for the Fibonacci numbers.
%C A104162 Without multiplicities, this is A010056.
%C A104162 The number of nonnegative integer solutions of x^4 - 10*n^2*x^2 + 25*n^4 - 16 = 0. - _Hieronymus Fischer_, May 17 2007
%F A104162 G.f.: Sum_{k>=0} x^Fibonacci(k).
%F A104162 From _Hieronymus Fischer_, May 17 2007: (Start)
%F A104162 a(n) = 1+floor(arcsinh(sqrt(5)*n/2)/log(phi))-ceiling(arccosh(sqrt(5)*n/2)/log(phi)), for n>0, where phi=(1+sqrt(5))/2.
%F A104162 a(n) = A108852(n) - A108852(n-1) for n>0.
%F A104162 a(n) = A130233(n) - A130233(n-1) for n>0.
%F A104162 a(n) = 1 + A130233(n) - A130234(n) for n>0.
%F A104162 a(n) = A130234(n+1) - A130234(n) for n>=0. (End)
%e A104162 a(1)=2 since F(1)=F(2)=1.
%o A104162 (PARI) a(n)=if(n==1,return(2)); my(k=n^2);k+=((k + 1) << 2);issquare(k) || issquare(k-8) \\ _Charles R Greathouse IV_, Feb 03 2014; typo corrected by _Georg Fischer_, Jun 22 2022
%Y A104162 Cf. A000045.
%Y A104162 Partial sums are in A108852.
%Y A104162 See also A130233 and A130234.
%K A104162 easy,nonn
%O A104162 0,2
%A A104162 _Paul Barry_, Apr 01 2005