|
%I #12 Jan 14 2020 00:54:21
%S 1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,2,
%T 1,0,1,0,1,0,1,0,1,0,3,0,1,0,1,0,1,0,1,0,1,4,1,0,1,0,1,0,1,0,1,0,5,0,
%U 1,0,1,0,1,0,1,0,1,6,1,0,1,0,1,0,1,0,1
%N a(n) is the numbers of ways to write n = u + v where the decimal representations of u and of v have the same number of digits d for d = 0..9.
%C In other words, a(n) is the number of ways to write n as the sum of two anagrams.
%C Leading zeros are ignored.
%H Rémy Sigrist, <a href="/A331218/b331218.txt">Table of n, a(n) for n = 0..20000</a>
%H Rémy Sigrist, <a href="/A331218/a331218.gp.txt">PARI program for A331218</a>
%H Rémy Sigrist, <a href="/A331218/a331218.png">Scatterplot of (x, y) such that 0 <= x, y <= 10^3 and x and y are decimal anagrams</a> (a(n) corresponds to the number of pixels (x, y) such that x+y = n)
%e For n = 44:
%e - we have the following ways to write 44 as a sum of two anagrams:
%e u v
%e -- --
%e 13 31
%e 22 22
%e 31 13
%e - hence a(44) = 3.
%o (PARI) See Links section.
%Y Cf. A330827 (ternary analog), A331216 (binary analog).
%K nonn,base
%O 0,34
%A _Rémy Sigrist_, Jan 12 2020
|
