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 A244744 #14 Feb 24 2022 02:54:32 %S A244744 46,253,649,6049,69989,166213,551137,9064261,68444596,347562415, %T A244744 612220081 %N A244744 Smallest number with additive excess n. %C A244744 Let m = Product p_j ^ a_j be the standard prime factorization of m. The additive excess of m is defined to be Sum||p_j ^ a_j|| - ||m|| where ||m||=A005245(n) is the complexity of n. %C A244744 The n-th term of this sequence is the least number m with additive excess n. %H A244744 J. Arias de Reyna and J. van de Lune, <a href="http://arxiv.org/abs/1404.1850">The question "How many 1's are needed?" revisited</a>, arXiv preprint arXiv:1404.1850 [math.NT], 2014. %e A244744 ||253||=17, ||11||=8, ||23||=11. 11 + 8 - 17 = 2. The second term is 253. %Y A244744 Cf. A244743, A005245. %K A244744 nonn,more %O A244744 1,1 %A A244744 _Juan Arias-de-Reyna_, Jul 05 2014