|
%I #13 Oct 08 2016 02:07:52
%S 6,13,19,25,37,47,49,65,69,77,89,103,107,113,131,141,151,159,173,185,
%T 193,199,213,239,235,247,267,275,279,287,317,317,335,353,355,373,385,
%U 393,409,427,433,441,453,469,469,499,503,513,535,565
%N a(n) = prime(2*n) - prime(2*n-1) + prime(2*n+1).
%C Original name was: Difference and sum of staircase primes according to the rule: bottom - top + next top.
%C We list the primes in staircase fashion as follows.
%C 2
%C 3.5
%C ..7.11
%C ....13.17
%C .......19.23
%C ..........29.31
%C .............37.41
%C .....................
%C ....................n
%C ....................n+1.n+2.
%C The right diagonal, RD(n), is the set of top primes and the left diagonal, LD(x), is the set of bottom primes. Then a(n) = LD(n+1) - RD(n) + RD(n+2).
%H G. C. Greubel, <a href="/A135274/b135274.txt">Table of n, a(n) for n = 1..1000</a>
%F a(n) = A181428(2*n-1). - _R. J. Mathar_, Sep 10 2016
%t Join[{6},#[[3]]-#[[2]]+#[[4]]&/@Partition[Prime[Range[2,110]],4,2]] (* _Harvey P. Dale_, Nov 16 2011 *)
%o (PARI) g(n) = forstep(x=1,n,2,y=prime(x+1)-prime(x)+prime(x+2);print1(y","))
%o (PARI) a(n)=prime(2*n)-prime(2*n-1)+prime(2*n+1); \\ _Joerg Arndt_, Oct 08 2016
%K nonn,easy
%O 1,1
%A _Cino Hilliard_, Dec 02 2007
%E New name from _Joerg Arndt_, Oct 08 2016
|
