Generalized Beatty sequences.
Mercer, A.McD. (1978)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Mercer, A.McD. (1978)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Manfred Peter (2002)
Acta Arithmetica
Similarity:
Simpson, Jamie (2004)
Integers
Similarity:
Vinh, Le Anh (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Keijo Ruohonen (2008)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A new algorithm is presented for the D0L sequence equivalence problem which, when the alphabets are fixed, works in time polynomial in the rest of the input data. The algorithm uses a polynomial encoding of words and certain well-known properties of -rational sequences.
Breuer, Florian (2007)
Integers
Similarity:
Benito, Manuel, Creyaufmüller, Wolfgang, Varona, Juan L., Zimmermann, Paul (2002)
Experimental Mathematics
Similarity:
Kimberling, Clark (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Andrica, Dorin, Piticari, Mihai (2002)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Barbero, Stefano, Cerruti, Umberto, Murru, Nadir (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Mauro Torelli (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
Increasing integer sequences include many instances of interesting sequences and combinatorial structures, ranging from tournaments to addition chains, from permutations to sequences having the that any integer greater than 1 can be obtained as the sum of two elements in the sequence. The paper introduces and compares several of these classes of sequences, discussing recurrence relations, enumerative problems and questions concerning shortest sequences.
Kimberling, Clark (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Pelesko, John A. (2004)
Journal of Integer Sequences [electronic only]
Similarity: