OFFSET
1,1
COMMENTS
We study words made of letters from an alphabet of size b, where b >= 1. (Here b=9.) We assume the letters are labeled {1,2,3,...,b}. There are b^n possible words of length n.
We say that a word is in "standard order" if it has the property that whenever a letter i appears, the letter i-1 has already appeared in the word. This implies that all words begin with the letter 1.
These are the words described in row b=9 of the array in A278986.
This sequence can be potentially expanded by a much more efficient algorithm than the brute-force one presented in the program section.
REFERENCES
Daniel Devatman Hromada, Integer-based nomenclature for the ecosystem of repetitive expressions in complete works of William Shakespeare, submitted to special issue of Argument and Computation on Rhetorical Figures in Computational Argument Studies, 2016.
LINKS
Daniel Devatman Hromada, List of n, a(n) for n = 1..142407 (All words with at most 10 digits.)
Daniel Devatman Hromada, Integer-based nomenclature for the ecosystem of repetitive expressions in complete works of William Shakespeare, August 2018.
Joerg Arndt and N. J. A. Sloane, Counting Words that are in "Standard Order"
MATHEMATICA
Select[Range[2*10^4], And[Max[DigitCount@ #] >= 2, Range@ Length@ Union@ # == DeleteDuplicates@ # &@ IntegerDigits@ #] &] (* Michael De Vlieger, Nov 10 2016 *)
CROSSREFS
KEYWORD
base,easy,nonn
AUTHOR
Daniel Devatman Hromada, Nov 10 2016
EXTENSIONS
Edited by N. J. A. Sloane, Dec 06 2016
Duplicated terms removed from b-file by Andrew Howroyd, Feb 27 2018
STATUS
approved