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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093275 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 75. 0

%I

%S 0,75,9750,997500,99975000,9999750000,999997500000,99999975000000,

%T 9999999750000000,999999997500000000,99999999975000000000,

%U 9999999999750000000000,999999999997500000000000,99999999999975000000000000,9999999999999750000000000000

%N a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 75.

%H Hans Havermann, <a href="/A093211/a093211.txt">Table of A093211-A093299</a>

%e a(4) is 997500 because its length-4 substrings (9975, 9750, 7500) are all distinct and divisible by 75 and there is no larger number with this property.

%Y Cf. A093211, A093212, ..., A093299.

%K base,nonn

%O 1,2

%A _Hans Havermann_, Mar 29 2004

%E a(9)-a(15) from _John Cerkan_, Jan 05 2018

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 January 18 13:49 EST 2020. Contains 331009 sequences. (Running on oeis4.)