A230865 -id:A230865 - cp's OEIS frontend

A230867 Smallest number m such that u + (sum of base-5 digits of u) = m has exactly n solutions.

0, 6, 26, 632, 1953134, 30517578152

Offset: 1

N. J. A. Sloane, Nov 05 2013

Indices of records in A230866: a(n) is the index of the first n in A230866.

The next two terms are a(7) = 5^165 + 27, a(8) = 5^317 + 633.

			a(5) = 1953134 corresponds to the five solutions:
1953099 (base-5: 444444344)
1953103 (base-5: 444444403)
1953105 (base-5: 444444410)
1953129 (base-5: 1000000004)
1953131 (base-5: 1000000011).

Pontus von Brömssen, Table of n, a(n) for n = 1..8 (based on comment about a(7) and a(8))
Max Alekseyev, Table of expressions for a(n), for n=1..100
Max A. Alekseyev and N. J. A. Sloane, On Kaprekar's Junction Numbers, arXiv:2112.14365, 2021; Journal of Combinatorics and Number Theory 12:3 (2022), 115-155.

A230868 gives the leading power of 5 in a(n).
Smallest number m such that u + (sum of base-b digits of u) = m has exactly n solutions, for bases 2 through 10: A230303, A230640, A230638, A230867, A238840, A238841, A238842, A238843, A006064.
Cf. A230865, A230866.

a(5) corrected by Donovan Johnson, Nov 05 2013

A230866 Number of integers m such that m + (sum of digits in base-5 representation of m) = 2n.

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 2, 3, 3, 3, 3, 2, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 1, 2, 2, 1, 2, 2, 1, 2, 3

Offset: 0

N. J. A. Sloane, Nov 05 2013

Donovan Johnson, Table of n, a(n) for n = 0..10000

Cf. A230865, A230643.

cp's OEIS Frontend

A230867 Smallest number m such that u + (sum of base-5 digits of u) = m has exactly n solutions.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs