login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A139138
Numbers divisible by at least two of their digits.
3
11, 12, 15, 22, 24, 33, 36, 44, 48, 55, 66, 77, 88, 99, 101, 102, 104, 105, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 128, 131, 132, 135, 138, 140, 141, 142, 144, 145, 147, 148, 150, 151, 152, 153, 155, 156, 161, 162
OFFSET
1,1
COMMENTS
Digits need not be distinct. This may be considered row 2 of an infinite array whose 1st row is A038770. Each such row is a subset of the ones above it.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..100 from Alvin Hoover Belt)
MATHEMATICA
fQ[n_] := Count[Mod[n, Flatten[IntegerDigits[n] /. {0 -> {}}]], 0] > 1; Select[ Range@ 170, fQ] (* Robert G. Wilson v, Jun 23 2014 *)
Select[Range[200], Count[Divisible[#, Select[IntegerDigits[#], #>0&]], True]>1&] (* Harvey P. Dale, Dec 16 2015 *)
PROG
(Python)
from sympy import factorint
def ok(n): return sum(1 for d in map(int, str(n)) if d > 0 and n%d == 0) > 1
print([k for k in range(163) if ok(k)]) # Michael S. Branicky, Nov 12 2021
CROSSREFS
Sequence in context: A128997 A189836 A292683 * A249766 A113600 A255725
KEYWORD
base,easy,nonn,dumb
AUTHOR
Jonathan Vos Post, Jun 05 2008
EXTENSIONS
More terms from Alvin Hoover Belt, Apr 06 2009
Own omission (140) fixed by Alvin Hoover Belt, Apr 18 2009
STATUS
approved