A244744 Smallest number with additive excess n.

46, 253, 649, 6049, 69989, 166213, 551137, 9064261, 68444596, 347562415, 612220081

Offset

1,1

Comments

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.

The n-th 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 and J. van de Lune, The question "How many 1's are needed?" revisited, arXiv preprint arXiv:1404.1850 [math.NT], 2014.

Example

||253||=17, ||11||=8, ||23||=11.  11 + 8 - 17 = 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,more

Author

Juan Arias-de-Reyna, Jul 05 2014

Status

approved