Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Jun 03 2013 09:03:43
%S 2,3,5,9,13,17,21,25,33,39,45,53,57,61,69,79,85,91,99,103,109,117,125,
%T 137,147,151,155,159,163,179,195,203,209,219,229,235,245,253,261,271,
%U 277,287,297,301,305,317,339,353,357,361,369,375,385,399,409,419,425
%N a(n) = prime(n) + prime(n+1) - 2n - 1.
%o (PARI) a(n) = prime(n) + prime(n+1) - 2*n - 1 \\ _Michel Marcus_, Jun 03 2013
%Y Cf. A108562.
%K easy,nonn
%O 1,1
%A _Giovanni Teofilatto_, Jul 05 2005
%E Extended by _Ray Chandler_, Jul 10 2005