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 A134245 #12 Jan 15 2020 00:26:08
%S A134245 2,8,88,384,1056,2310,207936,417219,2978610,6215400,9216124,205006774,
%T A134245 255230655,576178034,1157525280,2038109955,3053762208,10584038058,
%U A134245 25042362120,1025402527504,2304427934330,11623068703428
%N A134245 Terms in A007468 which are multiples of their indices.
%C A134245 If A007468(j) is a multiple of j, we add A007468(j) to this sequence. This sequence is a subsequence of A007468. - _R. J. Mathar_, Nov 16 2007
%H A134245 Chai Wah Wu, <a href="/A134245/b134245.txt">Table of n, a(n) for n = 1..28</a>
%F A134245 a(n) = A007468(A134244(n)).
%e A134245 3+5=8 is a multiple of i=2 and is added to the sequence. 7+11+13 is not a multiple of 3 and is skipped. 17+19+23+29=88 is a multiple of 4 and is added to the sequence. 31+37+41+43+47=199 is not a multiple of 5 and is skipped.
%p A134245 A000217 := proc(n) n*(n+1)/2 ; end: A007468 := proc(n) add( ithprime(j),j=A000217(n-1)+1..A000217(n)) ; end: for n from 1 to 800 do a := A007468(n) ; if a mod n =0 then printf("%d, ",a) ; fi ; od: # _R. J. Mathar_, Nov 16 2007
%Y A134245 Cf. A134244, A134246, A007468.
%K A134245 nonn
%O A134245 1,1
%A A134245 _Enoch Haga_, Oct 15 2007, Oct 16 2007
%E A134245 Edited and corrected by _R. J. Mathar_, Nov 16 2007
%E A134245 Corrected by _R. J. Mathar_, Nov 16 2007
%E A134245 Edited by _Max Alekseyev_, Nov 08 2011