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 A077371 #13 Jun 03 2015 19:33:38 %S A077371 0,1,1,2,3,5,8,13,21,34,55,89,233,610,987 %N A077371 Fibonacci numbers whose internal digits form a Fibonacci number. Equivalently, Fibonacci numbers from which deleting the MSD and LSD leaves a Fibonacci number. %C A077371 Conjecture: The sequence is finite. %C A077371 No more terms < 10^6. - _Lars Blomberg_, May 20 2015 %C A077371 From _Manfred Scheucher_, Jun 02 2015 (Start) %C A077371 No more terms < 10^10000. %C A077371 When considering binary representations, the sequence would be 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 144, and no further terms < 2^150000 (about 10^44095). %C A077371 When considering k-ary representations with k=2..100, each of the sequences has some small terms in the beginning (as in the 10-ary case) and no further terms <10^1000. %C A077371 The sequence seems to be finite for any base, not just for base 10. %C A077371 Another observation: When considering k-ary representations with k=55,144,377,... (Fibonacci numbers with even index, A001906), the number of "initial terms" (terms <10^1000) increases very fast. %C A077371 (End) %H A077371 Manfred Scheucher, <a href="/A077371/a077371.sage.txt">Sage Script</a> %Y A077371 Cf. A077372, A077373, A077374, A077375. %K A077371 base,more,nonn %O A077371 1,4 %A A077371 _Amarnath Murthy_, Nov 06 2002