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!)
A093272 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 72. 0
0, 72, 9360, 993600, 889928800, 98899208800, 9988992008800, 999889920008800, 99998899200008800, 88888898888888880888888888, 98888889888088888808880888888, 99888888988800888888088800888888, 99988888898880008888880888000888888 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 993600 because its length-4 substrings (9936, 9360, 3600) are all distinct and divisible by 72 and there is no larger number with this property.

CROSSREFS

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

Sequence in context: A283093 A178635 A271189 * A105347 A093236 A146500

Adjacent sequences:  A093269 A093270 A093271 * A093273 A093274 A093275

KEYWORD

base,nonn

AUTHOR

Hans Havermann, Mar 29 2004

EXTENSIONS

a(11)-a(13) 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 12:42 EST 2020. Contains 330958 sequences. (Running on oeis4.)