Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093292
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093292 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 92. +0
1
0, 92, 7368, 3036808, 99912, 9999488888, 9999940, 220202004404040088080800, 550505000880808000, 66666006004444400400 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 3036808 because its length-4 substrings (3036, 0368, 3680, 6808) are all distinct and divisible by 92, and there is no larger number with this property

CROSSREFS

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

Adjacent sequences: A093289 A093290 A093291 this_sequence A093293 A093294 A093295

Sequence in context: A035741 A035808 A017755 this_sequence A093246 A097568 A086001

KEYWORD

base,nonn

AUTHOR

Hans Havermann (pxp(AT)rogers.com), Mar 29 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 October 15 20:12 EDT 2008. Contains 145099 sequences.


AT&T Labs Research