|
Search: id:A115337
|
|
|
| A115337 |
|
a(n) is the smallest number representable in exactly n ways as a sum of 3 palindromes (each of them >= 0). |
|
+0
2
|
|
| 0, 2, 3, 4, 5, 28, 6, 7, 24, 8, 22, 9, 10, 88, 11, 12, 13, 15, 189, 211, 121, 110, 243, 244, 143, 268, 176, 165, 187, 303, 337, 335, 325, 343, 334, 323, 345, 373, 391, 383, 404, 393, 458, 423, 426, 435, 413, 446, 454, 492, 517, 505, 464, 538, 527, 474, 549, 547
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(6)=28 since 28 = 22+0+6 = 22+1+5 = 22+2+4 = 22+3+3 = 11+9+8 =
11+11+6 and no number less than 28 has 6 such decompositions.
|
|
MATHEMATICA
|
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}]
|
|
CROSSREFS
|
Cf. A115336.
Sequence in context: A124232 A051143 A084853 this_sequence A076209 A037399 A086130
Adjacent sequences: A115334 A115335 A115336 this_sequence A115338 A115339 A115340
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Giovanni Resta (g.resta(AT)iit.cnr.it), Jan 20 2006
|
|
|
Search completed in 0.002 seconds
|
