Counting Keith numbers.
Klazar, Martin, Luca, Florian (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Klazar, Martin, Luca, Florian (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Erdős, Paul, Sarkozy, Gabor N. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Canfield, E.Rodney, Corteel, Sylvie, Savage, Carla D. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.
de Koninck, Jean-Marie, Doyon, Nicolas, Luca, Florian (2011)
Journal of Integer Sequences [electronic only]
Similarity:
Broughan, Kevin A., Luca, Florian, Shparlinski, Igor E. (2010)
Integers
Similarity:
Chan, Tsz Ho (2004)
Integers
Similarity:
Friedlander, John, Iwaniec, Henryk (1998)
Annals of Mathematics. Second Series
Similarity:
Woodford, Roger (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Kumchev, Angel V. (2008)
Integers
Similarity:
M. Narlikar, K. Ramachandra (1980)
Acta Arithmetica
Similarity:
Baier, Stephan (2004)
Integers
Similarity:
Flajolet, Philippe, Gerhold, Stefan, Salvy, Bruno (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: