|
%I #34 Feb 23 2021 09:24:52
%S 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,
%T 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,
%U 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
%N Number of values of k such that k + (sum of digits of k) is n.
%C a(n) is the number of times n occurs in A062028.
%C For n>=1, a(10^n) = a(9*n-1). - _Max Alekseyev_, Feb 23 2021
%H Reinhard Zumkeller, <a href="/A230093/b230093.txt">Table of n, a(n) for n = 0..10000</a>
%H <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a>
%p # Maple code for A062028, A230093, A003052, A225793, A230094.
%p with(LinearAlgebra):
%p read transforms; # to get digsum
%p M := 1000; A062028 := Array(0..M); A230093 := Array(0..M);
%p for n from 0 to M do
%p m := n+digsum(n);
%p A062028[n] := m;
%p if m <= M then A230093[m] := A230093[m]+1; fi;
%p od:
%p t1:=[seq(A062028[i],i=0..M)]; # A062028 as list (but incorrect offset 1)
%p t2:=[seq(A230093[i],i=0..M)]; # A230093 as list, but then a(0) has index 1
%p # A003052 := COMPl(t1); # COMPl has issues, may be incorrect for M <> 1000
%p ctmax:=4;
%p for h from 0 to ctmax do ct[h] := []; od:
%p for i from 1 to M do
%p h := lis2[i];
%p if h <= ctmax then ct[h] := [op(ct[h]),i]; fi;
%p od:
%p A225793 := ct[1]; A230094 := ct[2]; # A003052 := ct[0]; # see there for better code
%t 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 *)
%o (Haskell) a230093 n = length $ filter ((== n) . a062028) [n - 9 * a055642 n .. n] -- _Reinhard Zumkeller_, Oct 11 2013
%o (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
%Y Cf. A006064, A007953 (sum of digits), A062028 (n + sum of its digits), A004207, A228085, A003052, A176995, A225793, A230094, A055642.
%Y Cf. A107740 (this applied to primes).
%K nonn,base
%O 0,102
%A _N. J. A. Sloane_, Oct 10 2013
%E Edited by _M. F. Hasler_, Nov 08 2018
|
