Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083958
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083958 Smallest multiple of n using all digits of (n-1) at least once and no others; or 0 if no such number exists. +0
2
0, 0, 222, 0, 0, 0, 666666, 0, 888888888, 0, 110, 0, 221, 0, 0, 0, 1666, 0, 1881, 0, 20202, 1122, 2222222222222222222222, 2232, 0, 52, 22626, 2772, 82882, 0, 333033, 0, 23232, 0, 0, 0, 3663, 0, 38883, 0, 444440, 114114, 24444, 333344, 0, 4554, 66646 (list; graph; listen)
OFFSET

1,3

COMMENT

If n contains all odd digits then a(n+1) = 0. If n+1 is not divisible by 5 and n contains an even digit then a(n+1) is nonzero. Infinitely many triples of successive zeros are there.

It's not clear whether or not a digit that occurs twice in n-1 is required to occur twice in a(n). The first time it matters is a(101), which is either 101 or 1010. - David Wasserman (wasserma(AT)spawar.navy.mil), Dec 03 2004

CROSSREFS

Cf. A083959.

Sequence in context: A020247 A011816 A048902 this_sequence A083959 A078212 A078251

Adjacent sequences: A083955 A083956 A083957 this_sequence A083959 A083960 A083961

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 20 2003

EXTENSIONS

Corrected and extended by David Wasserman (wasserma(AT)spawar.navy.mil), Dec 03 2004

page 1

Search completed in 0.005 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