cp's OEIS Frontend

A269316 Intersection of A269315 and A269314.

%I A269316 #21 May 24 2019 11:22:01
%S A269316 15,24,30,258,372,645,2076,2268,2385,2505,3045,3090,3120,3336,3366,
%T A269316 3450,3555,3678,4122,4143,4233,4302,4497,5118,5202,5586,6717,6855,
%U A269316 7662,7731,8082,8130,8340,9177,9648,9759,9795,10080,10242,10545,10830,10926,11001,11130
%N A269316 Intersection of A269315 and A269314.
%C A269316 All terms are multiple of 3.
%H A269316 Paolo P. Lava, <a href="/A269316/b269316.txt">Table of n, a(n) for n = 1..400</a>
%e A269316 15 = 1+4 + 1+3 + 1+2 + 1+1 + 1+0 = 1+6 + 1+7;
%e A269316 24 = 2+3 + 2+2 + 2+1 + 2+0 + 1+9 = 2+5 + 2+6 + 2+7;
%e A269316 30 = 2+9 + 2+8 + 2+7 = 3+1 + 3+2 + 3+3 + 3+4 + 3+5.
%p A269316 P:= proc(q) local a, b, c, k, n; for n from 1 to q do a:=0; b:=0;
%p A269316 while a<n do b:=b+1; c:=n-b; for k from 1 to ilog10(n-b)+1 do a:=a+(c mod 10); c:=trunc(c/10); od; od;
%p A269316 if a=n then a:=0; b:=0;
%p A269316 while a<n do b:=b+1; c:=n+b; for k from 1 to ilog10(n+b)+1 do a:=a+(c mod 10); c:=trunc(c/10); od; od;
%p A269316 if a=n then print(n); fi; fi; od; end: P(10^6);
%t A269316 A269314 = Select[Range[11130], (x = # + 1; s = Total[IntegerDigits[x]]; While[s < #, x++; s += Total[IntegerDigits[x]]]; s == #) &];
%t A269316 A269315 = Select[Range[3,11130], (x = # - 1; s = Total[IntegerDigits[x]]; While[s < #, x--; s += Total[IntegerDigits[x]]]; s == #) &];
%t A269316 Intersection[A269314, A269315] (* _Robert Price_, May 22 2019 *)
%Y A269316 Cf. A269314, A269215.
%K A269316 nonn,base,easy
%O A269316 1,1
%A A269316 _Paolo P. Lava_, Feb 25 2016
%E A269316 Name corrected by _Robert Price_, May 22 2019