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 A330070 #30 Dec 02 2019 11:24:27 %S A330070 2,3,7,11,17,25,59,67,185,193,563,571,1697,1747,5141,5149,11995,25727, %T A330070 27439,78893,82345,240131,243583,723845,727297,2174987,2178439, %U A330070 6530119,6530123,13061947,19590377,39182441,52242689,91425127,195910507,235092943,626913953 %N A330070 a(n) is the smallest integer k > 1 such that k cannot be expressed as a sum of distinct earlier terms nor is a multiple of any earlier term. %C A330070 Conjecture: Composite terms k greater than 25 will have either two or six nontrivial divisors (that is, divisors d with 1 < d < k). %C A330070 The total numbers of divisors of the first 31 terms are 2, 2, 2, 2, 2, 3, 2, 2, 4, 2, 2, 2, 2, 2, 4, 4, 4, 4, 4, 2, 8, 2, 2, 8, 2, 4, 2, 8, 4, 2, 2. - _N. J. A. Sloane_, Dec 01 2019 %H A330070 Rémy Sigrist and Giovanni Resta, <a href="/A330070/b330070.txt">Table of n, a(n) for n = 1..48</a> %H A330070 Rémy Sigrist, <a href="/A330070/a330070.txt">C++ program for A330070</a> %e A330070 a(6) = 25 = 5 * 5: 5 is not in the sequence, and no combination of 2, 3, 7, 11, and 17 sums to 25. %o A330070 (C++) See Links section. %Y A330070 Cf. A330071, A330126. %K A330070 nonn %O A330070 1,1 %A A330070 _J. Stauduhar_, Nov 30 2019 %E A330070 Terms a(24)-a(31) from Christian Lawson-Perfect, Dec 01 2019 %E A330070 Terms a(32)-a(37) from _Rémy Sigrist_, Dec 02 2019