|
%I #13 May 26 2019 18:04:14
%S 22,15,26,18,28,39,68,69,88,99,299,399,589,699,799,899,999,2899,3999,
%T 5999,6999,7999,9899,9999,29999,39999,58999,69999,89999,99999,299899,
%U 399999,499999,689999,699999,889999,999999,1999999,3899999,3999999
%N The smallest composite number larger than the n-th composite number, which has a sum of digits equal to the n-th composite number.
%C Variant of A073866, where the requirement that a(n) > A002808(n) is dropped.
%F min{c in A002808, c> A002808(n): A007953(c) = A002808(n)}. - _R. J. Mathar_, Dec 06 2011
%e The first composite is 4, and the first sum of digits is 13, but since that is prime, we go to the next, 22, which being composite is a(1).
%p A161551 := proc(n)
%p for j from n+1 do
%p if digsum(A002808(j)) = A002808(n) then
%p return A002808(j) ;
%p end if;
%p end do:
%p end proc:
%p seq(A161551(n),n=1..30) ; # _R. J. Mathar_, Dec 06 2011
%o (UBASIC)
%o 10 'compsdig, _Enoch Haga_, Jun 12 2009
%o 20 N=1
%o 30 Q=str(N)
%o 40 L=len(Q)
%o 50 for X=1 to L
%o 60 M=str(mid(Q,X,1)): Z=Z+val(mid(Q,X,1))
%o 70 next X
%o 80 if Z=56 and Z<>prmdiv(Z) and N<>prmdiv(N) then print N: stop
%o 90 Z=0: N=N+1: goto 30
%Y Cf. A075360, A054750.
%K base,easy,nonn
%O 1,1
%A _Enoch Haga_, Jun 13 2009
|
