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 A081652 #10 Aug 23 2024 22:04:50
%S A081652 1,1,1,1,1,2,1,2,1,1,1,2,1,7,1,8,1,1,1,4,1,2,1,1,1,2,1,4,1,5,1,1,11,1,
%T A081652 7,1,1,2,1,1,1,2,1,1,1,1,1,1,1,1,1,2,1,2,1,1,1,2,1,1,1,2,1,1,1,11,1,1,
%U A081652 1,2,1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,8,1,1,1,4,1,2,1,8,1,2,1,10,1,17,1,4
%N A081652 Greatest common divisor of n and sum of decimal digits of n-th prime.
%F A081652 a(n) = GCD(n, A007605(n)).
%e A081652 a(16) = GCD(16, A007953(A000040(16))) = GCD(16, A007953(53)) = GCD(16,5+3) = GCD(8*2,8) = 8.
%t A081652 Table[GCD[n,Total[IntegerDigits[Prime[n]]]],{n,110}] (* _Harvey P. Dale_, Jul 12 2012 *)
%Y A081652 Cf. A000040, A007953, A081653, A066750.
%K A081652 nonn,base,easy
%O A081652 1,6
%A A081652 _Reinhard Zumkeller_, Mar 25 2003