Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #22 Oct 16 2018 11:24:20
%S 1,1,1,2,1,2,2,3,2,4,3,4,2,4,2,6,2,6,3,6,2,7,3,7,3,7,2,9,2,7,3,9,3,10,
%T 4,10,4,11,3,12,2,11,3,11,1,12,2,10,4,11,2,14,3,11,4,13,1,13,2,11,3,
%U 12,2,15,2,13,5,14,3,17,2,13,4,15,2,17,2,12,4,15
%N Number of ways to write n as the sum, u + v + w, of three base-2 palindromes (from A006995) with 0 <= u <= v <= w.
%C Every number n can be written as the sum of four base-2 palindromes.
%C a(A261678(n)) = 0.
%H Rémy Sigrist, <a href="/A319439/b319439.txt">Table of n, a(n) for n = 0..10000</a>
%H A. Rajasekaran, J. Shallit, T. Smith, <a href="https://arxiv.org/abs/1706.10206">Sums of Palindromes: an Approach via Automata</a>, arXiv:1706.10206 [cs.FL], 2017.
%H Rémy Sigrist, <a href="/A319439/a319439.gp.txt">PARI program for A319439</a>
%e a(13) = 4 because 13 can be written as the sum of three base-2 palindromes in four different ways:
%e 13 = 5 + 5 + 3 = 101_2 + 101_2 + 11_2,
%e 13 = 7 + 3 + 3 = 111_2 + 11_2 + 11_2,
%e 13 = 7 + 5 + 1 = 111_2 + 101_2 + 1_2, and
%e 13 = 9 + 3 + 1 = 1001_2 + 11_2 + 1_2.
%o (PARI) See Links section.
%Y Cf. A006995, A261132, A261678.
%K nonn,base,look
%O 0,4
%A _Peter Kagey_, Sep 18 2018
%E a(0) corrected by _Rémy Sigrist_, Sep 19 2018