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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093251 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 51. 0
0, 51, 5612, 11224488, 9990933303, 666060333030, 77777551111188, 99999984, 888888180555555750, 33333030336666606066, 7777777730744444444904, 888888888084222222222021, 22222202002025555550500505, 99999999999975, 999999999990009666666666660006 (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(4) is 11224488 because its length-4 substrings (1122, 1224, 2244, 2448, 4488) are all distinct and divisible by 51 and there is no larger number with this property.

CROSSREFS

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

Sequence in context: A015271 A221116 A099397 * A184282 A232278 A208350

Adjacent sequences:  A093248 A093249 A093250 * A093252 A093253 A093254

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 29 2004

EXTENSIONS

a(11)-a(15) 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 November 30 03:48 EST 2021. Contains 349417 sequences. (Running on oeis4.)