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 A053056 #15 Mar 18 2016 04:02:11 %S A053056 0,1,2,3,5,8,21,233,317811,3524578,7778742049,259695496911122585, %T A053056 19740274219868223167,10284720757613717413913, %U A053056 263621064469290555679241849789653324393054271110084140201023 %N A053056 Fibonacci numbers whose digit sum is also a Fibonacci number. %C A053056 Is this sequence finite? %C A053056 It is heuristically infinite because of the divergence of the harmonic series. - _Charles R Greathouse IV_, Sep 20 2012 %H A053056 Chai Wah Wu, <a href="/A053056/b053056.txt">Table of n, a(n) for n = 1..24</a> (all terms < 10^1000). %H A053056 Felice Russo, <a href="http://www.gallup.unm.edu/~smarandache/Felice-Russo-book1.pdf"> A set of new Smarandache functions, sequences and conjectures in number theory</a>. %e A053056 317811 is in the sequence because the sum of its digits 3+1+7+8+1+1=21 is also a Fibonacci number. - Luc Stevens (lms022(AT)yahoo.com), Apr 15 2006 %p A053056 with(combinat): F:=[seq(fibonacci(n),n=2..80)]: a:=proc(n) local ff, sod: ff:=convert(fibonacci(n), base,10): sod:=add(ff[i],i=1..nops(ff)): if member(sod,F)=true then fibonacci(n) else fi end: seq(a(n),n=2..300); # _Emeric Deutsch_, Apr 17 2006 %Y A053056 Cf. A000045, A053056, A061268, A053049. %K A053056 base,nonn %O A053056 1,3 %A A053056 _Felice Russo_, Feb 25 2000 %E A053056 More terms from Larry Reeves (larryr(AT)acm.org), Oct 03 2000 %E A053056 More terms from _Emeric Deutsch_, Apr 17 2006 %E A053056 Edited by _R. J. Mathar_, Aug 08 2008