A331218 - OEIS

A331218

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.

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, 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, 1, 0, 1, 0, 1, 0, 1, 0, 1, 6, 1, 0, 1, 0, 1, 0, 1, 0, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,34

COMMENTS

In other words, a(n) is the number of ways to write n as the sum of two anagrams.

Leading zeros are ignored.

LINKS

Rémy Sigrist, Table of n, a(n) for n = 0..20000

Rémy Sigrist, PARI program for A331218

Rémy Sigrist, Scatterplot of (x, y) such that 0 <= x, y <= 10^3 and x and y are decimal anagrams (a(n) corresponds to the number of pixels (x, y) such that x+y = n)

EXAMPLE

For n = 44: