Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093228
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093228 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 28. +0
1
0, 284, 336448, 977280084004, 73500084000, 888748888048888, 7777756000008400000, 7777977200004004000080080000, 777777336000000448000000, 777777977200000080080000004004000000 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 336448 because its length-3 substrings (336, 364, 644, 448) are all distinct and divisible by 28, and there is no larger number with this property

CROSSREFS

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

Adjacent sequences: A093225 A093226 A093227 this_sequence A093229 A093230 A093231

Sequence in context: A002046 A108110 A049024 this_sequence A043415 A105921 A090089

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research