Displaying similar documents to “Counting Keith numbers.”

On the sum of digits of some sequences of integers

Javier Cilleruelo, Florian Luca, Juanjo Rué, Ana Zumalacárregui (2013)

Open Mathematics

Similarity:

Let b ≥ 2 be a fixed positive integer. We show for a wide variety of sequences {a n}n=1∞ that for almost all n the sum of digits of a n in base b is at least c b log n, where c b is a constant depending on b and on the sequence. Our approach covers several integer sequences arising from number theory and combinatorics.

Lucas balancing numbers

Kálmán Liptai (2006)

Acta Mathematica Universitatis Ostraviensis

Similarity:

A positive n is called a balancing number if 1 + 2 + ⋯ + ( n - 1 ) = ( n + 1 ) + ( n + 2 ) + ⋯ + ( n + r ) . We prove that there is no balancing number which is a term of the Lucas sequence.