cp's OEIS Frontend

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.

A372111 Partial sums of A124652.

This page as a plain text file.
%I A372111 #15 Apr 25 2024 13:43:02
%S A372111 1,3,6,10,15,24,30,38,54,66,77,84,98,126,144,168,189,216,248,279,360,
%T A372111 370,390,403,572,594,627,646,663,702,728,777,814,858,894,942,996,1060,
%U A372111 1085,1120,1160,1189,1230,1245,1290,1320,1370,1450,1508,1560,1620,1692,1739
%N A372111 Partial sums of A124652.
%C A372111 Analogous to A109735 with respect to A109890.
%C A372111 A007947(A124652(n+1)) | a(n) for n > 2.
%H A372111 Michael De Vlieger, <a href="/A372111/b372111.txt">Table of n, a(n) for n = 1..10000</a>
%e A372111 See A124652.
%t A372111 nn = 54; c[_] := False; a[1] = 1; a[2] = 2; s = u = 3; c[1] = c[2] = True;
%t A372111 f[x_] := f[x] = Times @@ FactorInteger[x][[All, 1]];
%t A372111 {1}~Join~Reap[Do[Sow[s]; k = u; While[Or[Mod[s, f[k]] != 0, c[k]], k++];
%t A372111     Set[{a[n], c[k]}, {k, True}];
%t A372111     s += k; If[k == u, While[c[u], u++]], {n, 3, nn}] ][[-1, 1]]
%Y A372111 Cf. A007947, A109890, A109735, A124652.
%K A372111 nonn
%O A372111 1,2
%A A372111 _Michael De Vlieger_, Apr 25 2024