Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052191
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052191 Smallest multiple of n with no isolated digits. +0
1
11, 22, 33, 44, 55, 66, 77, 88, 99, 1100, 11, 444, 1144, 3388, 555, 2288, 1122, 666, 2299, 1100, 777, 22, 2277, 888, 1100, 1144, 999, 3388, 2233, 3300, 4433, 6688, 33, 1122, 1155, 1188, 111, 3344, 5577, 2200, 2255, 5544, 3311, 44, 4455, 5566, 7755 (list; graph; listen)
OFFSET

1,1

COMMENT

isol[n_ ] := Module[{},L={11}~Join~IntegerDigits[n ]~Join~{11}; l=Length[L ]; Apply[And,Table[L[[i ] ]==L[[i-1 ] ]||L[[i ] ]==L[[i+1 ] ],{i,2,l-1} ] ] ] a[n_ ] := a[n ]=Module[{},m=0; While[Not[isol[m ] ],m=m+n ]; m ] Table[a[i ],{i,1,100} ]

EXAMPLE

a(23)=2277 since 23*99=2277 and all the digits of 2277 have a neighboring digit which is the same.

CROSSREFS

Sequence in context: A056524 A110745 A020338 this_sequence A110732 A044836 A033008

Adjacent sequences: A052188 A052189 A052190 this_sequence A052192 A052193 A052194

KEYWORD

base,easy,nice,nonn

AUTHOR

Erich Friedman (efriedma(AT)stetson.edu), Jan 28 2000

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research