login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A230106 Number of m such that m + (product of nonzero digits of m) equals n. 2
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,13

COMMENTS

Number of times n appears in A063114.

LINKS

Table of n, a(n) for n=0..102.

Index entries for Colombian or self numbers and related sequences

MAPLE

# Maple code for A063114, A230106, A063425, A096922

with(LinearAlgebra):

read transforms; # to get digprod0

M:=1000;

lis1:=Array(0..M);

lis2:=Array(0..M);

ctmax:=4;

for i from 0 to ctmax do ct[i]:=Array(0..M); od:

for n from 0 to M do

m:=n+digprod0(n);

lis1[n]:=m;

if (m <= M) then lis2[m]:=lis2[m]+1; fi;

od:

t1:=[seq(lis1[i], i=0..M)]; # A063114

t2:=[seq(lis2[i], i=0..M)]; # A230106

COMPl(t1); # A063425

for i from 1 to M do h:=lis2[i];

if h <= ctmax then ct[h]:=[op(ct[h]), i]; fi; od:

len:=nops(ct[0]); [seq(ct[0][i], i=1..len)]; # A063425 again

len:=nops(ct[1]); [seq(ct[1][i], i=1..len)]; # A096922

CROSSREFS

Cf. A063108, A063114, A230099, A230104, A063425, A096922.

Variant of A096972.

Sequence in context: A277146 A026611 A277152 * A096972 A101227 A277162

Adjacent sequences:  A230103 A230104 A230105 * A230107 A230108 A230109

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane, Oct 13 2013

EXTENSIONS

a(1) corrected by Zak Seidov, Oct 24 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 08:36 EDT 2019. Contains 328107 sequences. (Running on oeis4.)