Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093236
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093236 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 36. +0
1
0, 72, 9720, 8892880, 988920880, 888984888084888, 988898408880840888, 998889840088808400888, 999888984000888084000888, 999988898400008880840000888 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 8892880 because its length-4 substrings (8892, 8928, 9288, 2880) are all distinct and divisible by 36, and there is no larger number with this property

CROSSREFS

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

Sequence in context: A119750 A093272 A105347 this_sequence A060507 A048544 A062076

Adjacent sequences: A093233 A093234 A093235 this_sequence A093237 A093238 A093239

KEYWORD

base,nonn

AUTHOR

Hans Havermann (pxp(AT)rogers.com), Mar 28 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research