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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093252 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 52. 0
0, 52, 9884, 7072808, 2210088400, 88800488800, 66666608888880, 99999952, 999999000444444000, 77777700008888880000 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 7072808 because its length-4 substrings (7072, 0728, 7280, 2808) are all distinct and divisible by 52 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A006179 A029809 A200576 * A200806 A098148 A068255

Adjacent sequences:  A093249 A093250 A093251 * A093253 A093254 A093255

KEYWORD

base,nonn

AUTHOR

Hans Havermann (gladhobo(AT)teksavvy.com), Mar 29 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 04:56 EST 2012. Contains 205985 sequences.