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 A067032 #8 Apr 19 2025 14:38:32 %S A067032 1,1,1,1,1,1,1,1,1,1,1,2,3,4,5,6,7,8,9,1,9,9,7,1,6,5,1,4,3,1,2,1,1,2, %T A067032 1,2,1,2,1,2,1,2,2,3,2,3,2,3,2,3,2,3,3,4,3,4,3,4,3,4,3,4,4,5,4,5,4,5, %U A067032 4,5,4,5,5,6,5,6,5,6,5,6,5,6,6,7,6,7,6,7,6,7,6,7,7,8,7,8,7,8,7,8,7,8,8,9,8 %N A067032 Number of k's such that A067030(n) = k + reverse(k). %H A067032 T. D. Noe, <a href="/A067032/b067032.txt">Table of n, a(n) for n = 0..1000</a> %e A067032 a(12) = 3 since A067030(12) = 33 and for k = 12, 21, 30 we have 33 = k + reverse(k). %o A067032 (ARIBAS) function a067032(a,b: integer); var n,k,c,i,rev: integer; st,nst: string; begin for n := a to b do k := 0; c := 0; while k <= n do st := itoa(k); nst := ""; for i := 0 to length(st) - 1 do nst := concat(st[i],nst); end; rev := atoi(nst); if n = k + rev then inc(c); end; inc(k); end; if c > 0 then write(c,","); end; end; end; a067032(0,1000); %Y A067032 Cf. A033865, A067030, A067031, A067033, A067034. %K A067032 base,easy,nonn %O A067032 0,12 %A A067032 _Klaus Brockhaus_, Dec 29 2001