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

 

Logo


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
0, 76, 7608, 775244, 99940888, 99909644404, 9999928, 99999964, 999999944, 33333030008888808000, 6666666306088888884080, 666666606660444444404440, 55555550555008888888088800, 5555555055500044444440444000, 111111110000100888888880000800 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..15.

Hans Havermann, Table of A093211-A093299

EXAMPLE

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.

CROSSREFS

Cf. A093211, A093212, ..., A093299.

Sequence in context: A234778 A139671 A098606 * A184290 A093238 A185984

Adjacent sequences:  A093273 A093274 A093275 * A093277 A093278 A093279

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 16 22:20 EST 2019. Contains 329208 sequences. (Running on oeis4.)