A093225 - OEIS

This site is supported by donations to The OEIS Foundation.

A093225

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

0, 7500, 975000, 99750000, 9997500000, 999975000000, 99999750000000 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	LINKS	`Hans Havermann, Table of A093211-A093299`
	EXAMPLE	`a(2) is 7500 because its length-2 substrings (75, 50, 00) are all distinct and divisible by 25 and there is no larger number with this property`
	CROSSREFS	`Cf. A093211, A093212, ..., A093299.` `Sequence in context: A116195 A051259 A178281 * A090742 A186938 A185749` `Adjacent sequences: A093222 A093223 A093224 * A093226 A093227 A093228`
	KEYWORD	`base,nonn`
	AUTHOR	`Hans Havermann (gladhobo(AT)teksavvy.com), Mar 28 2004`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 12:15 EST 2012. Contains 205909 sequences.