The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 3
 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: - we have the following ways to write 44 as a sum of two anagrams:   u   v   --  --   13  31   22  22   31  13 - hence a(44) = 3. PROG (PARI) See Links section. CROSSREFS Cf. A330827 (ternary analog), A331216 (binary analog). Sequence in context: A247477 A072927 A307194 * A120086 A215030 A175816 Adjacent sequences:  A331215 A331216 A331217 * A331219 A331220 A331221 KEYWORD nonn,base AUTHOR Rémy Sigrist, Jan 12 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 10 02:28 EDT 2020. Contains 336367 sequences. (Running on oeis4.)