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