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.

A152527 a(n) = (p(n)*p(n+1)-p(n+2))/2, where p(n) is the n-th odd prime.

This page as a plain text file.
%I A152527 #4 Jul 28 2015 04:07:01
%S A152527 4,12,32,63,101,150,204,318,431,553,737,858,984,1216,1533,1766,2008,
%T A152527 2342,2552,2842,3234,3645,4266,4847,5148,5456,5775,6095,7110,8250,
%U A152527 8904,9447,10280,11171,11772,12712,13524,14356,15393,16104
%N A152527 a(n) = (p(n)*p(n+1)-p(n+2))/2, where p(n) is the n-th odd prime.
%F A152527 a(n) = A111071(n+1)/2.
%p A152527 A152527 := proc(n)
%p A152527     j := n+1 ;
%p A152527     ithprime(j)*ithprime(j+1)-ithprime(j+2) ;
%p A152527     %/2 ;
%p A152527 end proc: # _R. J. Mathar_, Jul 28 2015
%Y A152527 Cf. A065091, A111071, A152528, A152529, A152530, A152531, A152532.
%K A152527 easy,nonn
%O A152527 1,1
%A A152527 _Omar E. Pol_, Dec 06 2008