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.

A024453 a(n) = [ (3rd elementary symmetric function of P(n))/(first elementary symmetric function of P(n)) ], where P(n) = {first n+2 primes}.

This page as a plain text file.
%I A024453 #7 May 01 2019 15:31:54
%S A024453 3,14,48,124,279,543,981,1710,2758,4329,6519,9365,13088,18023,24448,
%T A024453 32237,42031,53897,67765,84548,104253,127677,155845,188299,224778,
%U A024453 266201,312202,363845,426136,495751,574268,660165,758682,865898,984968,1116797
%N A024453 a(n) = [ (3rd elementary symmetric function of P(n))/(first elementary symmetric function of P(n)) ], where P(n) = {first n+2 primes}.
%H A024453 Robert Israel, <a href="/A024453/b024453.txt">Table of n, a(n) for n = 1..10000</a>
%F A024453 a(n) = floor(A024448(n)/A007504(n+2)). - _Robert Israel_, May 01 2019
%p A024453 N:= 100: # to get the first N terms
%p A024453 P:= [seq(ithprime(i),i=1..N+2)]:
%p A024453 E1:= ListTools:-PartialSums(P):
%p A024453 E2:= ListTools:-PartialSums([0,seq(P[i]*E1[i-1],i=2..N+2)]):
%p A024453 E3:= ListTools:-PartialSums([0,seq(P[i]*E2[i-1],i=2..N+2)]):
%p A024453 seq(floor(E3[n]/E1[n]),n=3..N+2); # _Robert Israel_, May 01 2019
%Y A024453 Cf. A007504, A024448.
%K A024453 nonn
%O A024453 1,1
%A A024453 _Clark Kimberling_