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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093212 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 12. 87
0, 72484, 97204804, 99720048004, 99972000480004, 99997200004800004, 99999720000048000004, 99999972000000480000004, 99999997200000004800000004, 99999999720000000048000000004 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Observation: at least for the first nine positive terms a(n) is also the concatenation of n-2 9´s, 72, n-2 0's, 48, n-2 0's, and 4. - Omar E. Pol, May 21 2017

LINKS

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

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(2) is 72484 because its length-2 substrings (72, 24, 48, 84) are all distinct and divisible by 12 and there is no larger number with this property

CROSSREFS

Cf. A093211, A093213, ..., A093299.

Sequence in context: A126658 A251340 A183788 * A114258 A238151 A234243

Adjacent sequences:  A093209 A093210 A093211 * A093213 A093214 A093215

KEYWORD

base,nonn,more

AUTHOR

Hans Havermann, Mar 28 2004

EXTENSIONS

a(8)-a(10) from John Cerkan, May 21 2017

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 December 7 18:19 EST 2021. Contains 349585 sequences. (Running on oeis4.)