

A244744


Smallest number with additive excess n.


0



46, 253, 649, 6049, 69989, 166213, 551137, 9064261, 68444596, 347562415, 612220081
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Let m = prod p_j^a_j be the standard prime factorization of m. The additive excess of m is defined to be sump_j^a_j  m where m=A005245(n) is the complexity of n.
The nth term of this sequence is the least number m with additive excess n.


LINKS

Table of n, a(n) for n=1..11.
J. Arias de Reyna, J. van de Lune, The question "How many 1's are needed?" revisited, arXiv preprint arXiv:1404.1850, 2014


EXAMPLE

253=17, 11=8, 23=11. 11+817=2. The second term is 253


CROSSREFS

Cf. A244743, A005245.
Sequence in context: A251410 A251403 A026913 * A156841 A086979 A289274
Adjacent sequences: A244741 A244742 A244743 * A244745 A244746 A244747


KEYWORD

nonn


AUTHOR

Juan AriasdeReyna, Jul 05 2014


STATUS

approved



