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!)
A093260 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 60. 0
0, 600, 96000, 9960000, 999600000, 99996000000, 9999960000000, 999999600000000, 99999996000000000, 9999999960000000000, 999999999600000000000, 99999999996000000000000, 9999999999960000000000000, 999999999999600000000000000, 99999999999996000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Hans Havermann, Table of A093211-A093299
EXAMPLE
a(3) is 96000 because its length-3 substrings (960, 600, 000) are all distinct and divisible by 60 and there is no larger number with this property.
CROSSREFS
Cf. A093211, A093212, ..., A093299.
Sequence in context: A223463 A023915 A035850 * A008689 A126835 A020370
KEYWORD
base,nonn
AUTHOR
Hans Havermann, Mar 29 2004
EXTENSIONS
a(9)-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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)