Law of Small Numbers, again

[Hans Havermann]

Back on 27 March I submitted the first of 89 sequences: a(n) is the 
largest number such that all of a(n)'s length-n substrings are distinct 
and divisible by x, for x = 11 to 99, based on an observation of Erich 
Friedman for x=19, n=3, as publicized by Ed Pegg's 22 March online 
MathPuzzle article. I highlighted the case of x=63 in a post (titled 
"Sevens") to this list.

Subsequent to my submissions, I asked Neil to delete the sequences for 
x=45 and x=90 as they appeared to be identical to x=30, A093230: 0, 
900, 99000, 9990000, 999900000, 99999000000, 9999990000000, 
999999900000000, ...

I'm currently in the process of upgrading these sequences from seven or 
eight to ten terms each and have discovered that in the case of x=45 
the sequence is not in fact identical to x=30.

a(n) is the largest number such that all of a(n)'s length-n substrings 
are distinct and divisible by 30:

0, 900, 99000, 9990000, 999900000, 99999000000, 9999990000000, 
999999900000000, 99999999000000000, 9999999990000000000, ...

a(n) is the largest number such that all of a(n)'s length-n substrings 
are distinct and divisible by 45:

0, 900, 99000, 9990000, 999900000, 99999000000, 9999990000000, 
999999900000000, 99999999000000000, 5555555595555555550555555555, ...