|
|
|
|
|
|
|
|
|
#20 by Bruno Berselli at Wed Sep 19 02:58:23 EDT 2018
|
|
|
|
|
|
|
|
#19 by Robert Israel at Tue Sep 18 19:02:58 EDT 2018
|
|
|
|
|
|
|
|
#18 by Robert Israel at Tue Sep 18 18:52:17 EDT 2018
|
|
| KEYWORD
|
nonn,base,new,look
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#17 by Robert Israel at Tue Sep 18 17:25:59 EDT 2018
|
|
|
|
|
|
|
|
#16 by Robert Israel at Tue Sep 18 17:25:39 EDT 2018
|
|
|
|
|
|
|
|
#15 by Robert Israel at Tue Sep 18 17:21:09 EDT 2018
|
|
|
|
|
|
|
|
#14 by Robert Israel at Tue Sep 18 16:27:30 EDT 2018
|
|
| LINKS
|
Robert Israel, <a href="/A319387/b319387.txt">Table of n, a(n) for n = 0..10000</a>
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#13 by Peter Luschny at Tue Sep 18 15:56:56 EDT 2018
|
|
|
|
|
|
|
|
#12 by Peter Luschny at Tue Sep 18 15:56:46 EDT 2018
|
|
| EXAMPLE
|
a(11) = 0 because 11 = 11 + 0, so 0 is the smallest palindrome in any partitioning of 11 as a sum of two palindromes. a(21) = 21 because 21 cannot be written as a sum of two palindromes.
a(21) = 21 because 21 cannot be written as a sum of two palindromes.
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#11 by Peter Luschny at Tue Sep 18 09:32:59 EDT 2018
|
|
|
|
|
|
|
