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.

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

This page as a plain text file.
%I A152530 #6 Jul 28 2015 04:14:16
%S A152530 7,16,48,80,174,230,372,528,684,1042,1234,1550,1884,2232,2720,3174,
%T A152530 3892,4264,4820,5536,5980,6948,7962,8892,9890,10704,11120,11982,13730,
%U A152530 14676,17268,18072,20274,20840,23242,24456,26056,28032
%N A152530 a(n) = p(n)*p(n+2)-p(n+1), where p(n) is the n-th prime.
%H A152530 Harvey P. Dale, <a href="/A152530/b152530.txt">Table of n, a(n) for n = 1..1000</a>
%p A152530 A152530 := proc(n)
%p A152530     ithprime(n)*ithprime(n+2)-ithprime(n+1) ;
%p A152530 end proc: # _R. J. Mathar_, Jul 28 2015
%t A152530 #[[1]]#[[3]]-#[[2]]&/@Partition[Prime[Range[50]],3,1] (* _Harvey P. Dale_, Dec 19 2012 *)
%Y A152530 Cf. A000040, A111071, A152527, A152528, A152529, A152531, A152532.
%K A152530 easy,nonn
%O A152530 1,1
%A A152530 _Omar E. Pol_, Dec 06 2008