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.

A239941 Primes p which are floor of Root-mean-cube (RMC) of prime(n), prime(n+1) and prime(n+2).

This page as a plain text file.
%I A239941 #24 Sep 27 2024 07:35:17
%S A239941 7,53,89,223,257,1097,6823,10181,12149,14783,15527,20063,22027,29917,
%T A239941 30539,40519,42491,43261,50543,51511,57727,65063,68639,72103,97453,
%U A239941 99391,100693,108463,108893,110281,111581,113363,116719,149623,153407,154211,155821,193057
%N A239941 Primes p which are floor of Root-mean-cube (RMC) of prime(n), prime(n+1) and prime(n+2).
%H A239941 Georg Fischer, <a href="/A239941/b239941.txt">Table of n, a(n) for n = 1..1745</a> (first 429 terms from K. D. Bajpai)
%e A239941 11, 13 and 17 are consecutive primes: sqrt(( 11^3 + 13^3 + 17^3)/3) = 53.044...: floor(53.044...) = 53, which is prime and appears in the sequence.
%e A239941 31, 37 and 41 are consecutive primes: sqrt(( 31^3 + 37^3 + 41^3)/3) = 223.13...: floor(223.13...) = 223, which is prime and appears in the sequence.
%p A239941 select(isprime, {seq(floor(sqrt(add(ithprime(n+i)^3, i=0..2)/3)), n=1..1000)})[]; # corrected by _Georg Fischer_, Sep 27 2024
%Y A239941 Cf. A000040, A075471, A088165, A240339.
%K A239941 nonn
%O A239941 1,1
%A A239941 _K. D. Bajpai_, Apr 03 2014