cp's OEIS Frontend

A230106 Number of m such that m + (product of nonzero digits of m) equals n.

%I A230106 #18 Oct 25 2013 04:57:31
%S A230106 0,0,1,0,1,0,1,0,1,0,1,1,2,0,2,0,2,0,2,0,1,0,2,1,1,0,2,0,1,1,0,0,1,1,
%T A230106 1,1,0,0,2,0,0,1,1,0,2,1,1,1,0,0,2,0,0,0,1,2,1,0,1,0,1,0,2,0,0,1,2,1,
%U A230106 1,0,1,0,0,0,2,1,0,1,1,0,2,1,0,0,0,1,2,0,2,1,0,0,1,0,1,1,0,0,2,1,1,1,3
%N A230106 Number of m such that m + (product of nonzero digits of m) equals n.
%C A230106 Number of times n appears in A063114.
%H A230106 <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a>
%p A230106 # Maple code for A063114, A230106, A063425, A096922
%p A230106 with(LinearAlgebra):
%p A230106 read transforms; # to get digprod0
%p A230106 M:=1000;
%p A230106 lis1:=Array(0..M);
%p A230106 lis2:=Array(0..M);
%p A230106 ctmax:=4;
%p A230106 for i from 0 to ctmax do ct[i]:=Array(0..M); od:
%p A230106 for n from 0 to M do
%p A230106 m:=n+digprod0(n);
%p A230106 lis1[n]:=m;
%p A230106 if (m <= M) then lis2[m]:=lis2[m]+1; fi;
%p A230106 od:
%p A230106 t1:=[seq(lis1[i],i=0..M)]; # A063114
%p A230106 t2:=[seq(lis2[i],i=0..M)]; # A230106
%p A230106 COMPl(t1); # A063425
%p A230106 for i from 1 to M do h:=lis2[i];
%p A230106 if h <= ctmax then ct[h]:=[op(ct[h]),i]; fi; od:
%p A230106 len:=nops(ct[0]); [seq(ct[0][i],i=1..len)]; # A063425 again
%p A230106 len:=nops(ct[1]); [seq(ct[1][i],i=1..len)]; # A096922
%Y A230106 Cf. A063108, A063114, A230099, A230104, A063425, A096922.
%Y A230106 Variant of A096972.
%K A230106 nonn,base
%O A230106 0,13
%A A230106 _N. J. A. Sloane_, Oct 13 2013
%E A230106 a(1) corrected by _Zak Seidov_, Oct 24 2013