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!)
A093281 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 81. 0
0, 81, 9729, 996399, 99954999, 99630099630, 999993699999, 99999927999999, 99999991899999991, 9999999990999999999, 999999999009999999990, 99999999900099999999900, 9999999990000999999999000, 999999999000009999999990000, 99999999999630099999999999630 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Hans Havermann, Table of A093211-A093299
EXAMPLE
a(4) is 996399 because its length-4 substrings (9963, 9639, 6399) are all distinct and divisible by 81 and there is no larger number with this property.
CROSSREFS
Cf. A093211, A093212, ..., A093299.
Sequence in context: A184337 A034993 A223328 * A059988 A017020 A237027
KEYWORD
base,nonn
AUTHOR
Hans Havermann, Mar 29 2004
EXTENSIONS
a(11)-a(15) from John Cerkan, Jan 05 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)