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 A097387 #6 Dec 15 2017 17:36:46 %S A097387 60,460,640,820,1360,1480,1620,1870,2110,2380,3460,3630,3880,4560, %T A097387 4650,5640,5650,5860,6210,6310,6360,6420,7480,8170,8680,8830,11680, %U A097387 11830,12280,12640,12820,13780,14620,15460,15640,15660,15880,16410,16420 %N A097387 Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime. %C A097387 Conjecture: Terms will always be multiples of ten. Aug 21, 2004: _Dean Hickerson_ proved this. %e A097387 640 is in the sequence because 6^0 + 640 = 641 and 6^1 + 641 = 647, both prime. %Y A097387 Cf. A054054, A054055, A097385, A097386. %K A097387 base,easy,nonn %O A097387 1,1 %A A097387 _Jason Earls_, Aug 18 2004