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!)
A093222 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 22. 1
0, 88, 990220, 8866886, 9999022220, 88886688886, 99999902222220, 888888668888886, 999999990222222220, 8888888866888888886, 9999999999022222222220, 88888888886688888888886, 99999999999902222222222220, 888888888888668888888888886 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Hans Havermann, Table of A093211-A093299
John Cerkan, Python 2.7
EXAMPLE
a(3) is 990220 because its length-3 substrings (990, 902, 022, 220) are all distinct and divisible by 22 and there is no larger number with this property
CROSSREFS
Cf. A093211, A093212, ..., A093299.
Sequence in context: A093244 A079036 A159420 * A114922 A036951 A051328
KEYWORD
base,nonn
AUTHOR
Hans Havermann, Mar 28 2004
EXTENSIONS
a(9)-a(14) from John Cerkan, Oct 25 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)