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 A050699 #12 Jul 16 2015 21:43:53
%S A050699 15,26,39,49,51,58,62,85,93,94,115,117,122,123,126,129,143,147,155,
%T A050699 158,159,165,169,177,178,183,185,187,203,205,221,225,226,244,246,265,
%U A050699 285,286,289,294,302,314,315,319,321,326,327,329,335,338,339,341,355,366
%N A050699 Nonprime numbers n such that n and n-reversed (<> n and no leading zeros) have the same number of prime factors (counted with multiplicity).
%H A050699 Nathaniel Johnston, <a href="/A050699/b050699.txt">Table of n, a(n) for n = 1..10000</a>
%e A050699 E.g., 321 = 3*107 and 123 = 3*41 -> both 321 and 123 have two prime factors.
%p A050699 with(numtheory): read(transforms): for n from 12 to 366 do r:=digrev(n): if(not isprime(n) and not n=r and not n mod 10 = 0 and bigomega(n)=bigomega(r))then printf("%d, ", n); fi: od: # _Nathaniel Johnston_, Jun 23 2011
%t A050699 nrnQ[n_]:=Module[{idn=IntegerDigits[n],rev},rev=Reverse[idn];!PrimeQ[n] &&First[rev]!=0&&idn!=rev&&PrimeOmega[n]==PrimeOmega[FromDigits[rev]]]; Select[Range[400],nrnQ] (* _Harvey P. Dale_, Jun 23 2011 *)
%Y A050699 Cf. A050700, A050701, A050702, A006567, A097393, A109018-A109031.
%K A050699 nonn,base,easy
%O A050699 1,1
%A A050699 _Patrick De Geest_, Aug 15 1999
%E A050699 Definition clarified by _Harvey P. Dale_, Jun 23 2011