cp's OEIS Frontend

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.

A067034 Largest k such that A067030(n) = k + reverse(k).

This page as a plain text file.
%I A067034 #8 Apr 19 2025 14:38:36
%S A067034 0,1,2,3,4,5,10,6,7,8,9,20,30,40,50,60,70,80,90,100,91,110,93,120,94,
%T A067034 95,130,96,97,140,98,99,150,200,160,210,170,220,180,230,190,240,250,
%U A067034 300,260,310,270,320,280,330,290,340,350,400,360,410,370,420,380,430
%N A067034 Largest k such that A067030(n) = k + reverse(k).
%H A067034 T. D. Noe, <a href="/A067034/b067034.txt">Table of n, a(n) for n = 0..1000</a>
%e A067034 a(12) = 30 since A067030(12) = 33 and 30 is the largest k such that 33 = k + reverse(k).
%o A067034 (ARIBAS) function a067034(a,b: integer); var n,k,m,i,rev: integer; st,nst: string; begin for n := a to b do k := 0; m := -1; 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 m := k; end; inc(k); end; if m >= 0 then write(m,","); end; end; end; a067034(0,500);
%Y A067034 Cf. A033865, A067031, A067031, A067032, A067033.
%K A067034 base,easy,nonn
%O A067034 0,3
%A A067034 _Klaus Brockhaus_, Dec 29 2001