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.

A074925 Numbers n such that n^3 is a sum of two successive primes.

This page as a plain text file.
%I A074925 #14 Jun 05 2018 17:46:53
%S A074925 2,6,28,42,72,162,174,220,222,234,246,252,296,344,380,390,486,510,584,
%T A074925 594,638,646,674,702,720,816,828,882,942,948,990,1044,1056,1146,1200,
%U A074925 1314,1422,1436,1554,1566,1596,1602,1632,1740,1770,1778,1806,1818,1824
%N A074925 Numbers n such that n^3 is a sum of two successive primes.
%C A074925 Prime(n)+ prime(n+1) as a square in A064397; n^2 as a sum of two successive primes in A074924; prime(n)+ prime(n+1) as a cube in A071220.
%H A074925 Chai Wah Wu, <a href="/A074925/b074925.txt">Table of n, a(n) for n = 1..10000</a> (terms for n = 1..429 from Zak Seidov)
%e A074925 6^3 = 216 = 107 + 109.
%t A074925 Surd[#,3]&/@Select[Total/@Partition[Prime[Range[150*10^6]],2,1], IntegerQ[ Surd[#,3]]&] (* _Harvey P. Dale_, Jun 05 2018 *)
%o A074925 (Python)
%o A074925 from sympy import nextprime, prevprime
%o A074925 A074925_list = [i for i in range(2,10**4,2) if prevprime(i**3//2) + nextprime(i**3//2) == i**3] # _Chai Wah Wu_, Feb 22 2017
%Y A074925 Cf. A064397, A071220, A074924.
%K A074925 nonn
%O A074925 1,1
%A A074925 _Zak Seidov_, Oct 02 2002
%E A074925 More terms from _Zak Seidov_, Jul 22 2009