Results 1 
2 of
2
The Encyclopedia of Integer Sequences
"... This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae, programs ..."
Abstract

Cited by 631 (15 self)
 Add to MetaCart
This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae, programs to generate the sequence, references, links to relevant web pages, and other
Lambda Words: A Class of Rich Words Defined Over an Infinite Alphabet
"... Lambda words are sequences obtained by encoding the differences between ordered elements of the form i + jθ, where i and j are nonnegative integers and 1 < θ < 2. Lambda words are rightinfinite words defined over an infinite alphabet that have connectionswithSturmianwords, Christoffelwords, andint ..."
Abstract
 Add to MetaCart
Lambda words are sequences obtained by encoding the differences between ordered elements of the form i + jθ, where i and j are nonnegative integers and 1 < θ < 2. Lambda words are rightinfinite words defined over an infinite alphabet that have connectionswithSturmianwords, Christoffelwords, andinterspersionarrays. Weshow that Lambda words are infinite rich words. Furthermore, any Lambda word may be mapped onto a rightinfinite word over a threeletter alphabet. Although the mapping preserves palindromes and nonpalindromes of the Lambda word, the resulting Gamma word is not rich. 1