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!)
A061362 Numbers in which each nonzero digit divides the number formed by the rest, i.e., the number obtained by just removing this digit. 0 is divisible by every number. 1

%I #11 Jul 30 2017 23:01:14

%S 1,2,3,4,5,6,7,8,9,10,11,20,22,30,33,40,44,50,55,60,66,70,77,80,88,90,

%T 99,100,101,102,105,110,111,120,122,124,126,142,150,155,162,168,186,

%U 200,202,204,210,220,222,240,244,248,250,284,300,303,306,324,330,333

%N Numbers in which each nonzero digit divides the number formed by the rest, i.e., the number obtained by just removing this digit. 0 is divisible by every number.

%H Harry J. Smith, <a href="/A061362/b061362.txt">Table of n, a(n) for n = 0..1000</a>

%e 142 is a member as 1 divides 42, 2 divides 14 and 4 divides 12.

%t ddnQ[n_]:=Module[{idn=IntegerDigits[n],nz,len,tr},nz=Select[idn,#!=0&];len = Length[idn];tr=Table[FromDigits[Drop[idn,{i}]],{i,len}];And@@ Table[ Divisible[ tr[[k]],nz[[k]]],{k,Length[nz]}]]; Select[Range[400],ddnQ] (* _Harvey P. Dale_, Jun 29 2015 *)

%o (PARI) { n=-1; for (m=1, 20080, for (i=0, 10^10, b=10^i; x=(m\b)*b; y=m-x; x=x\b; d=x%10; x=b*(x\10); if (d==0, d=1); if ((x+y)%d != 0, break); if (x==0, write("b061362.txt", n++, " ", m); break); ) ) } \\ _Harry J. Smith_, Jul 21 2009

%K nonn,base,easy

%O 0,2

%A _Amarnath Murthy_, Jun 26 2001

%E Corrected and extended by _Dean Hickerson_, Jul 10 2001

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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)