login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093262 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 62. 0
0, 62, 80620, 7006200, 99944888, 11011222022444044888088, 9999980, 9999050022220800, 888800008444400004222200002, 77770000704444000040 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 80620 because its length-3 substrings (806, 062, 620) are all distinct and divisible by 62 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A299826 A209905 A227357 * A159374 A115460 A116270

Adjacent sequences:  A093259 A093260 A093261 * A093263 A093264 A093265

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 29 2004

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 28 21:04 EDT 2022. Contains 354907 sequences. (Running on oeis4.)