Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093276
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093276 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 76. +0
1
0, 76, 7608, 775244, 99940888, 99909644404, 9999928, 99999964, 999999944, 33333030008888808000 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 775244 because its length-4 substrings (7752, 7524, 5244) are all distinct and divisible by 76 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A049669 A139671 A098606 this_sequence A093238 A028480 A111682

Adjacent sequences: A093273 A093274 A093275 this_sequence A093277 A093278 A093279

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research