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 A140763 #15 Jun 07 2022 13:43:53 %S A140763 2,10,77,238,874,2747,2914,3266,3638,4661,5117,5830,6601,6870,7141, %T A140763 9523,10191,10887,11966,13490,16401,19113,21037,23069,40313,41741, %U A140763 46191,50887,53342,54998,58406,60146,61910,65534,68341,72179,75130,76127,80189,82253 %N A140763 A051838 gives numbers m such that the sum of first m primes divides the product of the first m primes. This sequence gives corresponding values of the sum of first m primes. %C A140763 Sums (divisors) associated with A140761. %H A140763 Amiram Eldar, <a href="/A140763/b140763.txt">Table of n, a(n) for n = 1..1000</a> %F A140763 a(n)=A116536(n)/A159578(n) = A007504(A051838(n)). - _R. J. Mathar_, Jun 09 2008 %F A140763 Sum_{i=1..A051838(n)} prime(i). %e A140763 a(2)=10 because when 30 is divided by 10, the quotient is 3 and integral. %t A140763 Module[{nn=200,s,p},s=Accumulate[Prime[Range[nn]]];p=FoldList[ Times,Prime[ Range[nn]]];Select[Thread[{p,s}],Divisible[#[[1]],#[[2]]]&]][[All,2]] (* _Harvey P. Dale_, Jun 07 2022 *) %Y A140763 Cf. A051838, A116536, A140761, A159578, A116536. %K A140763 nonn %O A140763 1,1 %A A140763 _Enoch Haga_, May 28 2008 %E A140763 Corrected and edited by _N. J. A. Sloane_, Oct 01 2011