Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093229
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093229 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 29. +0
1
0, 587, 986, 5452494, 114848836366, 33300788800922200, 99997228888355, 666000665550005599900099, 555555552333333337, 5555050050111101001066660600607777070070 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 5452494 because its length-4 substrings (5452, 4524, 5249, 2494) are all distinct and divisible by 29, and there is no larger number with this property

CROSSREFS

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

Sequence in context: A020362 A051988 A142836 this_sequence A003539 A064209 A113509

Adjacent sequences: A093226 A093227 A093228 this_sequence A093230 A093231 A093232

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research