|
%I #25 May 21 2019 19:00:42
%S 0,1,21,32,43,54,65,76,87,98,111,131,141,151,161,171,181,191,201,1031,
%T 1041,1042,1051,1052,1053,1061,1062,1063,1064,1071,1072,1073,1074,
%U 1075,1081,1082,1083,1084,1085,1086,1091,1092,1093,1094,1095,1096,1097,1099
%N Nonnegative integers which cannot be obtained by adding exactly two nonzero decimal palindromes.
%C Every integer larger than two can be obtained by adding exactly three nonzero decimal palindromes.
%C The nonzero palindromes of this sequence are in A213879.
%H Alois P. Heinz, <a href="/A319477/b319477.txt">Table of n, a(n) for n = 1..65536</a>
%H Javier Cilleruelo, Florian Luca and Lewis Baxter, <a href="http://arxiv.org/abs/1602.06208v2">Every positive integer is a sum of three palindromes</a>, arXiv: 1602.06208 [math.NT], 2017, <a href="https://doi.org/10.1090/mcom/3221">Math. Comp., published electronically: August 15, 2017.
%H James Grime and Brady Haran, <a href="https://www.youtube.com/watch?v=OKhacWQ2fCs">Every Number is the Sum of Three Palindromes</a>, Numberphile video (2018)
%F A319468(a(n)) = 0.
%p p:= proc(n) option remember; local i, s; s:= ""||n;
%p for i to iquo(length(s), 2) do if
%p s[i]<>s[-i] then return false fi od; true
%p end:
%p h:= proc(n) option remember; `if`(n<1, 0,
%p `if`(p(n), n, h(n-1)))
%p end:
%p b:= proc(n, i, t) option remember; `if`(n=0, 1, `if`(t*i<n,
%p 0, b(n, h(i-1), t)+b(n-i, h(min(n-i, i)), t-1)))
%p end:
%p g:= n-> (k-> b(n, h(n), k)-b(n, h(n), k-1))(2):
%p a:= proc(n) option remember; local j; for j from 1+
%p `if`(n=1, -1, a(n-1)) while g(j)<>0 do od; j
%p end:
%p seq(a(n), n=1..80);
%Y Cf. A002113, A035137 (allowing zero), A213879, A261131, A319453, A319468, A319586.
%K nonn,base
%O 1,3
%A _Alois P. Heinz_, Sep 19 2018
|
