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 A135102 #12 Sep 24 2016 04:28:00
%S A135102 1,1,2,3,5,8,13,3,12,27,29,36,33,41,58,51,31,64,89,45,74,83,39,168,
%T A135102 145,193,170,129,149,104,211,289,274,175,257,252,125,161,318,347,447,
%U A135102 316,317,285,450,107,253,648,363,301,498,409,773,522,429,515,782,649,641
%N A135102 Digital sum (base the n-th prime) of Fibonacci(n).
%H A135102 G. C. Greubel, <a href="/A135102/b135102.txt">Table of n, a(n) for n = 1..1000</a>
%F A135102 a(n) = ds_prime(n)(Fib(n)), where ds_prime(n) = digital sum base the n-th prime.
%F A135102 a(n) = Fibonacci(n) - (prime(n)-1)*Sum{k>0} ( floor(Fibonacci(n)/prime(n)^k) ).
%e A135102 a(2) = ds_prime(2)(Fib(2)) = ds_3(1) = 1;
%e A135102 a(10) = ds_prime(10)(55) = ds_29(55) = 1+26 = 27.
%t A135102 Table[Total[IntegerDigits[Fibonacci[n],Prime[n]]],{n,60}] (* _Harvey P. Dale_, May 05 2013 *)
%o A135102 (PARI) a(n) = vecsum(digits(fibonacci(n), prime(n))); \\ _Michel Marcus_, Sep 24 2016
%Y A135102 Cf. A000040, A000045, A007953, A054899, A075771, A131451, A133620, A133900, A134599.
%K A135102 nonn,base
%O A135102 1,3
%A A135102 _Hieronymus Fischer_, Dec 24 2007