This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A068064 #5 Jan 25 2024 08:06:48 %S A068064 1,1,1,1,1,1,2,3,4,5,6,7,8,9,1,9,1,1,1,2,2,2,2,2,3,3,3,3,3,4,4,4,4,4, %T A068064 5,5,5,5,5,6,6,6,6,6,7,7,7,7,7,8,8,8,8,8,9,9,9,9,9,1,10,3,4,5,6,7,8,9, %U A068064 10,2,4,6,8,10,12,14,16,18,20,3,6,9,12,15,18,21,24,27,30,4,8,12,16,20,24 %N A068064 a(n) = number of integers k such that palindrome A068062(n) = k + reverse(k). %C A068064 The number of representations of a palindrome as a + b, where b = reverse(a); if a = reverse(b) and a is different from b, then a + b and b + a count as different representations. %e A068064 a(9) = 4, since A068062(9) = 44 and for k = 13, 22, 31, 40 we have 44 = k + reverse(k). %e A068064 a(16) = 9, since A068062(16) = 121 and for k = 29, 38, 47, 56, 65, 74, 83, 92, 110 we have 121 = k + reverse(k). %Y A068064 Cf. A002113, A067030, A067032, A068062. %K A068064 base,nonn %O A068064 1,7 %A A068064 _Klaus Brockhaus_, Feb 16 2002 %E A068064 Offset corrected by _Sean A. Irvine_, Jan 23 2024