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 A123139 #7 Jul 03 2021 16:53:46
%S A123139 6,2,4,10,21,9,-13,-64,-57,-73,-161,-192,-412,-697,-855,-935,-1272,
%T A123139 -1702,-2063,-2754,-3439,-4031,-4714,-5120,-5750,-7098,-8586,-10201,
%U A123139 -11989,-12545,-13055,-14716,-16784,-18473,-20253,-22825,-24924,-27514,-30288,-32870,-36369,-39363,-42481,-46996,-51743
%N A123139 a(n) = prime(n)*(prime(n + 1) + 1) - (n^3 + sum of digits of n^3).
%H A123139 A. Frank & P. Jacqueroux, <a href="http://www.paulcooijmans.com/others/intcontest.pdf">International Contest</a>, 2001. Item 30 = Item 21 - Item 24.
%F A123139 a(n) = A123134(n) - A123135(n). - _Michel Marcus_, Dec 03 2013
%t A123139 Table[Prime[n](Prime[n+1]+1)-(n^3+Total[IntegerDigits[n^3]]),{n,50}] (* _Harvey P. Dale_, Jul 03 2021 *)
%o A123139 (PARI) for(n=1,50,sda=eval(Vec(Str(n^3)));print1(prime(n)*(prime(n+1)+1)-(n^3+sum(i=1,length(sda),sda[i])),","))
%K A123139 sign,base
%O A123139 1,1
%A A123139 Herman Jamke (hermanjamke(AT)fastmail.fm), Sep 30 2006