|
%I #3 Mar 30 2012 17:40:34
%S 0,2,3,4,5,28,6,7,24,8,22,9,10,88,11,12,13,15,189,211,121,110,243,244,
%T 143,268,176,165,187,303,337,335,325,343,334,323,345,373,391,383,404,
%U 393,458,423,426,435,413,446,454,492,517,505,464,538,527,474,549,547
%N a(n) is the smallest number representable in exactly n ways as a sum of 3 palindromes (each of them >= 0).
%e a(6)=28 since 28 = 22+0+6 = 22+1+5 = 22+2+4 = 22+3+3 = 11+9+8 =
%e 11+11+6 and no number less than 28 has 6 such decompositions.
%t palQ[n_] := n == FromDigits@Reverse@IntegerDigits@n; pt = Select[Range[0, 10001], palQ]; t = Table[0, {i, 10000}]; Do[v=pt[[i]]+pt[[j]]+pt[[k]]; If[v<10000, t[[v+1]]++ ], {i, 200}, {j, i}, {k, j}]; Table[Position[t, k][[1, 1]]-1, {k, 60}]
%Y Cf. A115336.
%K base,nonn
%O 1,2
%A _Giovanni Resta_, Jan 20 2006
|
