cp's OEIS Frontend

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.

A262199 a(n) = prime(n)^3 - prime(n^3).

This page as a plain text file.
%I A262199 #15 Sep 08 2022 08:46:14
%S A262199 6,8,22,32,640,876,2604,3188,6648,16470,18834,35900,49518,54698,72504,
%T A262199 110004,157722,169422,231732,276112,292880,380748,441714,555252,
%U A262199 741144,835258,871866,976192,1015598,1130314,1700676,1861998,2144184
%N A262199 a(n) = prime(n)^3 - prime(n^3).
%C A262199 Commutator of (primes, cubes) at n.
%C A262199 All terms are even. For PrimePi(n^3) - PrimePi(n)^3 see A291538. - _Jonathan Sondow_, Sep 10 2017
%H A262199 G. C. Greubel, <a href="/A262199/b262199.txt">Table of n, a(n) for n = 1..300</a>
%F A262199 a(n) = A030078(n) - A055875(n).
%F A262199 a(n) = A291542(n) + A291541(n). - _Jonathan Sondow_, Sep 10 2017
%e A262199 For n = 2, a(n) = prime(n)^3 - prime(n^3) = 3^3 - 19 = 8.
%t A262199 Table[Prime[n]^3 - Prime(n^3), {n, 40}] (* _Alonso del Arte_, Sep 14 2015 *)
%o A262199 (PARI) a(n) = prime(n)^3 - prime(n^3);
%o A262199 vector(35,n,a(n))
%o A262199 (Magma) [NthPrime(n)^3 - NthPrime(n^3): n in [1..40]]; // _Vincenzo Librandi_, Sep 15 2015
%Y A262199 Cf. A123914, A030078, A055875. Twice A143680.
%Y A262199 Cf. A291538, A291541, A291542.
%K A262199 nonn,easy
%O A262199 1,1
%A A262199 _Altug Alkan_, Sep 14 2015