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 A136050 #14 Dec 02 2016 11:07:08
%S A136050 6,8,8,8,26,17,26,17,8,17,17,26,26,26,17,26,35,35,26,26,8,35,26,17,26,
%T A136050 35,44,26,17,35,35,35,35,26,35,26,17,26,26,26,17,35,26,35,26,35,26,17,
%U A136050 26,17,35,35,26,26,35,35,26,35,26,35,26,26,26,35,26,44,35,26,26,35,44,35
%N A136050 Sum of digits of product of twin primes A037074.
%C A136050 Conjecture: except for the initial term, each term is one less than a multiple of 9. - _Harvey P. Dale_, Dec 02 2016
%H A136050 Harvey P. Dale, <a href="/A136050/b136050.txt">Table of n, a(n) for n = 1..5000</a>
%F A136050 a(n) = A007953(A037074(n)). - _Michel Marcus_, Nov 04 2013
%e A136050 The product of the first twin primes is 15=3*5, and sum of digits of 15 is 6.
%t A136050 a = {6}; Do[If[PrimeQ[6n - 1] && PrimeQ[6n + 1], c = IntegerDigits[36n^2 - 1]; b = Total[c]; AppendTo[a, b]], {n, 400}]; a
%t A136050 Total[IntegerDigits[Times@@#]]&/@Select[Partition[Prime[Range[500]],2,1], #[[2]]- #[[1]]==2&] (* _Harvey P. Dale_, Dec 02 2016 *)
%o A136050 (PARI) lista(nn) = for (x=1, nn, if(prime(x+1)-prime(x)==2, print1(sumdigits(prime(x)*prime(x+1)), ", "))); \\ _Michel Marcus_, Nov 04 2013
%Y A136050 Cf. A002822, A037074, A007953, A136017.
%K A136050 nonn,base
%O A136050 1,1
%A A136050 _Artur Jasinski_, Dec 12 2007
%E A136050 First term a(1)=6 inserted by _Michel Marcus_, Nov 04 2013