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 A291542 #13 Sep 11 2017 13:53:23
%S A291542 4,6,10,-28,264,234,1054,950,2530,8700,9300,20054,27552,28208,36754,
%T A291542 63070,94518,96258,137484,163300,163958,219620,256138,330190,462884,
%U A291542 520150,524270,582294,588600,652236,1086612,1179000,1374384,1387220,1828230,1838274,2092496,2366760,2529382,2842390
%N A291542 a(n) = prime(n)^3 - prime(n) * prime(n^2).
%C A291542 Same as prime(n) * A123914(n). See A123914 for other comments and formulas.
%C A291542 All terms are even.
%C A291542 For prime(n)^3 - prime(n^3) see A262199.
%C A291542 For prime(n) * prime(n^2) - prime(n^3) see A291541.
%C A291542 For PrimePi(n) * PrimePi(n^2) - PrimePi(n)^3 see A291540.
%H A291542 Robert Israel, <a href="/A291542/b291542.txt">Table of n, a(n) for n = 1..10000</a>
%F A291542 a(n) + A291541(n) = A262199(n).
%e A291542 a(4) = prime(4)^3 - prime(4) * prime(16) = 7^3 - 7*53 = -28.
%p A291542 seq(ithprime(n)^3 - ithprime(n)*ithprime(n^2), n=1..100); # _Robert Israel_, Sep 11 2017
%t A291542 Table[ Prime[n]^3 - Prime[n] * Prime[n^2], {n, 40}]
%o A291542 (PARI) a(n) = prime(n)^3 - prime(n) * prime(n^2); \\ _Michel Marcus_, Sep 10 2017
%Y A291542 Cf. A000040, A000720, A123914, A262199, A291440, A291538, A291539, A291540, A291541.
%K A291542 sign
%O A291542 1,1
%A A291542 _Jonathan Sondow_, Aug 25 2017