cp's OEIS Frontend

A327264 Numbers k with digit_sum(2*k) = digit_sum(2+k).

%I A327264 #28 Sep 22 2019 04:08:32
%S A327264 2,11,20,47,74,83,92,101,110,137,146,164,173,182,191,200,227,236,245,
%T A327264 254,263,272,281,290,317,326,335,353,362,371,380,407,416,425,452,461,
%U A327264 470,497,524,533,542,569,578,614,623,632,641,659,668
%N A327264 Numbers k with digit_sum(2*k) = digit_sum(2+k).
%C A327264 The graph is fairly interesting, as the terms are clustered together linearly in different sections.
%C A327264 The sequence is infinite since it contains all the terms 2*10^k, for k >= 0. - _Metin Sariyar_, Sep 16 2019
%H A327264 Max Lacoma, <a href="/A327264/b327264.txt">Table of n, a(n) for n = 1..10000</a>
%t A327264 Select[Range@700, Equal @@ Plus @@@ IntegerDigits[{2 #, 2 + #}] &] (* _Giovanni Resta_, Sep 16 2019 *)
%o A327264 (MATLAB - Checks up to n=10000)
%o A327264 n = 0;
%o A327264 x = [];
%o A327264 while n < 10000
%o A327264     two_n = sum(str2num(num2str(2*n)'));
%o A327264     two_plus_n = sum(str2num(num2str(2+n)'));
%o A327264     if two_n == two_plus_n
%o A327264         x(numel(x)+1) = n;
%o A327264     end
%o A327264     n = n+1;
%o A327264 end
%o A327264 x
%o A327264 (PARI) isok(k) = sumdigits(2*k) == sumdigits(k+2); \\ _Michel Marcus_, Sep 16 2019
%Y A327264 Cf. A007953.
%K A327264 nonn,look,base
%O A327264 1,1
%A A327264 _Max Lacoma_, Sep 14 2019