|
| |
|
|
A230093
|
|
Number of values of k such that k + (sum of digits of k) is n.
|
|
16
|
|
|
|
1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,102
|
|
|
COMMENTS
|
a(n) = number of times n occurs in A062028.
|
|
|
LINKS
|
Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
Index entries for Colombian or self numbers and related sequences
|
|
|
MAPLE
|
# Maple code for A062028, A230093, A003052, A225793, A230094
with(LinearAlgebra):
read transforms; # to get digsum
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+digsum(n);
lis1[n]:=m;
if (m <= M) then lis2[m]:=lis2[m]+1; fi;
od:
t1:=[seq(lis1[i], i=0..M)]; # A062028
t2:=[seq(lis2[i], i=0..M)]; # A230093
COMPl(t1); # A003052
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)]; # A003052 again
len:=nops(ct[1]); [seq(ct[1][i], i=1..len)]; # A225793
len:=nops(ct[2]); [seq(ct[2][i], i=1..len)]; # A230094
|
|
|
PROG
|
(Haskell)
a230093 n = length $ filter ((== n) . a062028) [n - 9 * a055642 n .. n]
-- Reinhard Zumkeller, Oct 11 2013
|
|
|
CROSSREFS
|
Cf. A006064, A007953, A062028, A004207, A228085, A003052, A176995, A225793, A230094, A055642.
Sequence in context: A073520 A152137 A097470 * A033322 A130713 A236619
Adjacent sequences: A230090 A230091 A230092 * A230094 A230095 A230096
|
|
|
KEYWORD
|
nonn,base
|
|
|
AUTHOR
|
N. J. A. Sloane, Oct 10 2013
|
|
|
STATUS
|
approved
|
| |
|
|
