cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A342855 Numbers that contain a digit 0 (A011540) and that are divisible by their nonzero digits (A002796).

This page as a plain text file.
%I A342855 #17 Nov 25 2024 08:57:53
%S A342855 10,20,30,40,50,60,70,80,90,100,101,102,104,105,110,120,140,150,200,
%T A342855 202,204,208,210,220,240,250,280,300,303,306,330,360,400,404,408,420,
%U A342855 440,480,500,505,510,520,540,550,600,606,630,660,700,707,770,800,808,840,880,900,909,990,1000
%N A342855 Numbers that contain a digit 0 (A011540) and that are divisible by their nonzero digits (A002796).
%C A342855 If m is a term, so is 10*m.
%H A342855 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%F A342855 a(n) ~ 2520n. - _Charles R Greathouse IV_, Nov 25 2024
%e A342855 208 = 2*104 = 8*26 is divisible by 2 and divisible by 8, 208 contains a digit 0, hence 208 is a term.
%t A342855 q[n_] := MemberQ[(d = IntegerDigits[n]), 0] && AllTrue[d, # == 0 || Divisible[n, #] &]; Select[Range[1000], q] (* _Amiram Eldar_, Mar 25 2021 *)
%o A342855 (PARI) isok(m) = my(d=digits(m)); if (vecmin(d), return (0)); d = vecsort(select(x->(x > 0), d),,8); for (k=1, #d, if (m % d[k], return(0))); return(1); \\ _Michel Marcus_, Mar 29 2021
%Y A342855 Intersection of A002796 and A011540.
%K A342855 nonn,base
%O A342855 1,1
%A A342855 _Bernard Schott_, Mar 25 2021