login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

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

%I

%S 0,76,7608,775244,99940888,99909644404,9999928,99999964,999999944,

%T 33333030008888808000,6666666306088888884080,666666606660444444404440,

%U 55555550555008888888088800,5555555055500044444440444000,111111110000100888888880000800

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

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

%e a(4) is 775244 because its length-4 substrings (7752, 7524, 5244) are all distinct and divisible by 76 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(11)-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 December 8 14:38 EST 2019. Contains 329865 sequences. (Running on oeis4.)