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!)
A093258 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 58. 0
0, 58, 986, 556844, 881026680, 30803880208220, 9990906888080, 99999946, 999999982, 11110100106666060060, 11110100100222202002004444040040088880800800, 999999990990666666660660444444440440, 99999999977702222222228880, 99999999999972 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 556844 because its length-4 substrings (5568, 5684, 6844) are all distinct and divisible by 58 and there is no larger number with this property.

CROSSREFS

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

Sequence in context: A305263 A157252 A142966 * A184599 A160347 A181280

Adjacent sequences:  A093255 A093256 A093257 * A093259 A093260 A093261

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 29 2004

EXTENSIONS

a(11)-a(14) from John Cerkan, Jan 08 2018

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 June 24 16:57 EDT 2021. Contains 345417 sequences. (Running on oeis4.)