Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093252
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093252 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 52. +0
1
0, 52, 9884, 7072808, 2210088400, 88800488800, 66666608888880, 99999952, 999999000444444000, 77777700008888880000 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(4) is 7072808 because its length-4 substrings (7072, 0728, 7280, 2808) are all distinct and divisible by 52, and there is no larger number with this property

CROSSREFS

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

Adjacent sequences: A093249 A093250 A093251 this_sequence A093253 A093254 A093255

Sequence in context: A027550 A006179 A029809 this_sequence A098148 A068255 A070908

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 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research