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!)
A093283 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 83. 0
0, 83, 2498, 9960, 55527888, 999984, 9999923, 4440400499909009, 444040040777070070, 9999999941, 1111100001099999000090, 111111000001777777000007, 66666600000605555550000050, 7777777770770733333333303303, 999999999099090333333333033030111111111011010 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(5) is 55527888 because its length-5 substrings (55527, 55278, 52788, 27888) are all distinct and divisible by 83 and there is no larger number with this property.

CROSSREFS

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

Sequence in context: A233332 A175662 A103233 * A332615 A156924 A084299

Adjacent sequences:  A093280 A093281 A093282 * A093284 A093285 A093286

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 29 2004

EXTENSIONS

a(11)-a(15) from John Cerkan, Jan 04 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 13 06:07 EDT 2021. Contains 344981 sequences. (Running on oeis4.)