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.

A030058 Least non-sum of divisors of n for some n >= 1.

Original entry on oeis.org

2, 4, 8, 13, 16, 29, 32, 40, 43, 57, 61, 64, 73, 91, 92, 97, 121, 125, 128, 145, 169, 181, 187, 196, 211, 218, 225, 235, 249, 253, 256, 281, 313, 337, 361, 364, 373, 379, 393, 400, 404, 435, 466, 469, 481, 505, 509, 512, 547, 559, 561, 577, 589
Offset: 1

Views

Author

Keywords

Comments

Values appearing in A030057. - T. D. Noe, Apr 03 2014

Crossrefs

Cf. A030057.

Programs

  • Mathematica
    nmax = 100; terms = 53; notSum[n_] := notSum[n] = First[Complement[Range[ DivisorSigma[1, n] + 1], Total /@ Subsets[Divisors[n]]]]; seq0 = {}; While[u = Union[Table[notSum[n], {n, 1, nmax}]]; seq = Take[u, Min[terms, Length[u]]]; seq != seq0, seq0 = seq; Print[nmax]; nmax = nmax + 50]; A030058 = seq (* Jean-François Alcover, Oct 10 2016 *)