|
|
A230093
|
|
Number of values of k such that k + (sum of digits of k) is n.
|
|
22
|
|
|
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) is the number of times n occurs in A062028.
|
|
LINKS
|
|
|
MAPLE
|
with(LinearAlgebra):
read transforms; # to get digsum
for n from 0 to M do
m := n+digsum(n);
od:
t1:=[seq(A062028[i], i=0..M)]; # A062028 as list (but incorrect offset 1)
t2:=[seq(A230093[i], i=0..M)]; # A230093 as list, but then a(0) has index 1
# A003052 := COMPl(t1); # COMPl has issues, may be incorrect for M <> 1000
ctmax:=4;
for h from 0 to ctmax do ct[h] := []; od:
for i from 1 to M do
h := lis2[i];
if h <= ctmax then ct[h] := [op(ct[h]), i]; fi;
od:
|
|
MATHEMATICA
|
Module[{nn=110, a, b, c, d}, a=Tally[Table[x+Total[IntegerDigits[x]], {x, 0, nn}]]; b=a[[All, 1]]; c={#, 0}&/@Complement[Range[nn], b]; d=Sort[Join[a, c]]; d[[All, 2]]] (* Harvey P. Dale, Jun 12 2019 *)
|
|
PROG
|
(Haskell) a230093 n = length $ filter ((== n) . a062028) [n - 9 * a055642 n .. n] -- Reinhard Zumkeller, Oct 11 2013
(PARI) apply( A230093(n)=sum(i=n>0, min(9*logint(n+!n, 10)+8, n\2), sumdigits(n-i)==i), [1..150]) \\ M. F. Hasler, Nov 08 2018
|
|
CROSSREFS
|
Cf. A107740 (this applied to primes).
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|