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 A117774 #16 Jan 27 2022 13:38:15
%S A117774 1,2,3,5,8,21,144,2584,14930352,86267571272,498454011879264,
%T A117774 160500643816367088,114059301025943970552219,
%U A117774 5358359254990966640871840,555565404224292694404015791808,1226132595394188293000174702095995,18547707689471986212190138521399707760
%N A117774 Fibonacci numbers which are divisible by the sum of their digits.
%C A117774 Intersection of A005349 and A000045. - _Michel Marcus_, Jul 11 2016
%H A117774 Harvey P. Dale, <a href="/A117774/b117774.txt">Table of n, a(n) for n = 1..64</a>
%e A117774 2584 is in the sequence because (1) it is a Fibonacci number, (2) the sum of its digits is 2+5+8+4=19 and 2584 is divisible by 19.
%p A117774 with(combinat): a:=proc(n) local ff, sod: ff:=convert(fibonacci(n),base,10): sod:=add(ff[j],j=1..nops(ff)): if type(fibonacci(n)/sod,integer)=true then fibonacci(n) else fi end: seq(a(n),n=2..180); # _Emeric Deutsch_, Apr 16 2006
%t A117774 Select[Fibonacci[Range[2,250]],Divisible[#,Total[IntegerDigits[#]]]&] (* _Harvey P. Dale_, May 06 2013 *)
%o A117774 (PARI) {m=170; for(n=2,m,a=fibonacci(n); s=0; k=a; while(k>0, d=divrem(k,10); k=d[1]; s=s+d[2]); if(a%s==0,print1(a,",")))} \\ _Klaus Brockhaus_, Apr 16 2006
%Y A117774 Cf. A000045, A005349, A337448.
%K A117774 base,nonn
%O A117774 1,2
%A A117774 Luc Stevens (lms022(AT)yahoo.com), Apr 15 2006
%E A117774 a(11) to a(16) from _Emeric Deutsch_ and _Klaus Brockhaus_, Apr 16 2006
%E A117774 a(17) from _Harvey P. Dale_, May 06 2013