proposed
approved
proposed
approved
editing
proposed
(PARI) Palin(x)= { if (x==0, return(1)); if (x==10, return(0)); y=z=x; ds=ceil(log(x)/log(10)); t=10^(ds - 1); for (i=1, ds\2, d=y-10*(y\10); y\=10; e=z\t; z-=t*e; t/=10; if (e!=d, return(0)) ); return(1) } { default(realprecision, 50); n=0; forstep (m=0, 10^9, 19, if (Palin(m), next); x=m; r=0; while (x>0, d=x-10*(x\10); x\=10; r=r*10 + d); if (r%19 == 0, write("b062916.txt", n++, " ", m); if (n==1000, break)) ) } \\ _Harry J. Smith_, Aug 12 2009
{ default(realprecision, 50); n=0; forstep (m=0, 10^9, 19, if (Palin(m), next); x=m; r=0; while (x>0, d=x-10*(x\10); x\=10; r=r*10 + d); if (r%19 == 0, write("b062916.txt", n++, " ", m); if (n==1000, break)) ) } \\ Harry J. Smith, Aug 12 2009
approved
editing
editing
approved
Select[19 Range[1000], !PalindromeQ[#]&&Divisible[IntegerReverse[#], 19]&] (* Harvey P. Dale, Sep 20 2021 *)
approved
editing
editing
approved
(PARI) Palin(x)= { if (x==0, return(1)); if (x==10, return(0)); y=z=x; ds=ceil(log(x)/log(10)); t=10^(ds - 1); for (i=1, ds\2, d=y-10*(y\10); y\=10; e=z\t; z-=t*e; t/=10; if (e!=d, return(0)) ); return(1) } { default(realprecision, 50); n=0; forstep (m=0, 10^9, 19, if (Palin(m), next); x=m; r=0; while (x>0, d=x-10*(x\10); x\=10; r=r*10 + d); if (r%19 == 0, write("b062916.txt", n++, " ", m); if (n==1000, break)) ) } // _\\ _Harry J. Smith_, Aug 12 2009
Harry J. Smith, <a href="/A062916/b062916.txt">Table of n, a(n) for n = 1,...,1000</a>
(PARI) Palin(x)= { if (x==0, return(1)); if (x==10, return(0)); y=z=x; ds=ceil(log(x)/log(10)); t=10^(ds - 1); for (i=1, ds\2, d=y-10*(y\10); y\=10; e=z\t; z-=t*e; t/=10; if (e!=d, return(0)) ); return(1) } { default(realprecision, 50); n=0; forstep (m=0, 10^9, 19, if (Palin(m), next); x=m; r=0; while (x>0, d=x-10*(x\10); x\=10; r=r*10 + d); if (r%19 == 0, write("b062916.txt", n++, " ", m); if (n==1000, break)) ) } [From _// _Harry J. Smith_, Aug 12 2009]
proposed
editing
editing
proposed