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 A067033 #8 Apr 19 2025 14:38:40 %S A067033 0,1,2,3,4,5,10,6,7,8,9,11,12,13,14,15,16,17,18,100,19,29,39,120,49, %T A067033 59,130,69,79,140,89,99,150,101,160,111,170,121,180,131,190,141,151, %U A067033 102,161,112,171,122,181,132,191,142,152,103,162,113,172,123,182,133,192 %N A067033 Smallest k such that A067030(n) = k + reverse(k). %H A067033 T. D. Noe, <a href="/A067033/b067033.txt">Table of n, a(n) for n = 0..1000</a> %e A067033 a(12) = 12 since A067030(12) = 33 and 12 is the smallest k such that 33 = k + reverse(k). %o A067033 (ARIBAS) function a067033(a,b: integer); var n,k,i,rev: integer; st,nst: string; begin for n := a to b do k := 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 write(k,",") k := n + 1; else inc(k); end; end; end; end; a067033(0,500); %Y A067033 Cf. A033865, A067030, A067031, A067032, A067034. %K A067033 base,easy,nonn %O A067033 0,3 %A A067033 _Klaus Brockhaus_, Dec 29 2001