login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263314 Numbers m whose decimal representation includes at least one digit that divides every digit of m. 4
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 26, 28, 30, 31, 33, 36, 39, 40, 41, 42, 44, 48, 50, 51, 55, 60, 61, 62, 63, 66, 70, 71, 77, 80, 81, 82, 84, 88, 90, 91, 93, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Every number that has a digit '1' (cf. A011531) is in this sequence. Sequence A034838 (every digit divides n) is not a subsequence (e.g., 324 is not in the present sequence). - M. F. Hasler, Jan 10 2016
LINKS
PROG
(Python)
A263314_list = []
for i in range(10**4):
s = str(i)
for d in s:
j = int(d)
if j :
for e in s:
if int(e) % j:
break
else:
A263314_list.append(i)
break
# Chai Wah Wu, Oct 21 2015
(PARI) is(n)={n && (n=select(t->t, Set(digits(n))))%n[1]==0} \\ The divisor is necessarily the smallest nonzero digit. A vector having no nonzero component is considered equal to 0. - M. F. Hasler, Jan 10 2016
CROSSREFS
Sequence in context: A038770 A342591 A193176 * A267086 A362623 A032517
KEYWORD
nonn,base
AUTHOR
Giovanni Teofilatto, Oct 14 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 18:58 EDT 2024. Contains 371781 sequences. (Running on oeis4.)