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 A370137 #16 Jun 21 2025 07:53:59 %S A370137 6,10,14,18,34,38,42,62,66,90,214,218,222,242,246,270,422,426,450,630, %T A370137 2314,2318,2322,2342,2346,2370,2522,2526,2550,2730,4622,4626,4650, %U A370137 4830,6930,30034,30038,30042,30062,30066,30090,30242,30246,30270,30450,32342,32346,32370,32550,34650,60062,60066,60090,60270,62370,90090 %N A370137 Sums of three primorials > 1. %H A370137 Antti Karttunen, <a href="/A370137/b370137.txt">Table of n, a(n) for n = 1..15180</a> %H A370137 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a> %F A370137 For n > 1, A276150(a(n)) = 3. %F A370137 For n > 1, A276086(a(n)) = A369979(n). %e A370137 6 = A002110(1) + A002110(1) + A002110(1) = 2+2+2. %e A370137 10 = A002110(2) + A002110(1) + A002110(1) = 6+2+2. %e A370137 14 = A002110(2) + A002110(2) + A002110(1) = 6+6+2. %e A370137 18 = A002110(2) + A002110(2) + A002110(2) = 6+6+6. %e A370137 38 = A002110(3) + A002110(2) + A002110(1) = 30+6+2. %t A370137 nn = 6; MapIndexed[Set[P[First[#2] - 1], #1] &, FoldList[Times, 1, Prime@ Range[nn]]]; Table[P[i] + P[j] + P[k], {i, nn}, {j, i}, {k, j}] // Flatten (* _Michael De Vlieger_, Mar 09 2024 *) %o A370137 (PARI) %o A370137 up_to = 15180; %o A370137 A002110(n) = prod(i=1,n,prime(i)); %o A370137 A370137list(up_to) = { my(v = vector(up_to), i=0); for(x=1,oo, for(y=1,x, for(z=1,y, i++; if(i > up_to, return(v)); v[i] = A002110(x)+A002110(y)+A002110(z)))); (v); }; %o A370137 v370137 = A370137list(up_to); %o A370137 A370137(n) = v370137[n]; %Y A370137 Cf. A000292, A002110, A276086, A276150, A369979, A370138. %Y A370137 Subsequence of A370133. %Y A370137 Cf. also A370134. %K A370137 nonn %O A370137 1,1 %A A370137 _Antti Karttunen_, Mar 09 2024