Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093256
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093256 a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 56. +0
1
0, 56, 67280, 90728008, 773360088, 88877688800, 57750008008000, 77774704000080080000, 77777677600000800800000, 77777790720000008008000000 (list; graph; listen)
OFFSET

1,2

LINKS

Hans Havermann, Table of A093211-A093299

EXAMPLE

a(3) is 67280 because its length-3 substrings (672, 728, 280) are all distinct and divisible by 56 and there is no larger number with this property

CROSSREFS

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

Sequence in context: A090218 A159673 A009837 this_sequence A135315 A135426 A028670

Adjacent sequences: A093253 A093254 A093255 this_sequence A093257 A093258 A093259

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 December 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research