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 A259407 #24 Oct 31 2024 11:23:30
%S A259407 2,14930352,267914296,956722026041,781774079430987230203437,
%T A259407 178890334785183168257455287891792,
%U A259407 57602132235424755886206198685365216,55835073295300465536628086585786672357234389,15156039800290547036315704478931467953361427680642
%N A259407 Fibonacci numbers corresponding to the indices mentioned in A214852.
%C A259407 The data correspond to the 3rd, 36th, 42nd, 59th, 116th, 156th, 168th, 211th, 237th Fibonacci numbers.
%C A259407 Intersection of A000045 and A031443. - _Michel Marcus_, Jul 31 2015
%H A259407 Paolo Xausa, <a href="/A259407/b259407.txt">Table of n, a(n) for n = 1..70</a>
%F A259407 a(n) = A000045(A214852(n)).
%e A259407 a(2) = F(36) = 14930352 = 111000111101000110110000_2 has an equal number of 0's and 1's.
%t A259407 Select[Fibonacci[Range[300]], Equal @@ DigitCount[#, 2] &] (* _Paolo Xausa_, Oct 31 2024 *)
%o A259407 (Python)
%o A259407 f1=1; f2=1
%o A259407 while f1>0:
%o A259407 f3=f1+f2
%o A259407 c = bin(f3).split('b')[1]
%o A259407 if c.count("1")==c.count("0"):
%o A259407 print(f3)
%o A259407 f1=f2; f2=f3
%Y A259407 Cf. A000045, A031443, A214852.
%K A259407 nonn,easy,base
%O A259407 1,1
%A A259407 _Abhiram R Devesh_, Jun 26 2015