login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093223 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 23. 0
0, 46923, 5759897, 340483036808, 5554533373, 999994888881222226, 220202055050501101010, 11111001222220024444400488888008, 666660060555550050888880080, 33333003002222200200999990090066666006004444400400, 99999999978 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..11.

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(2) is 46923 because its length-2 substrings (46, 69, 92, 23) are all distinct and divisible by 23 and there is no larger number with this property.

CROSSREFS

Cf. A093211, A093212, ..., A093299.

Sequence in context: A234774 A236053 A109030 * A250688 A183601 A206252

Adjacent sequences:  A093220 A093221 A093222 * A093224 A093225 A093226

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 27 2004

EXTENSIONS

a(10-a(11) from John Cerkan, Jul 31 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 27 19:02 EDT 2021. Contains 348287 sequences. (Running on oeis4.)