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 #14 Oct 22 2020 14:07:32
%S 1,4,9,10,11,12,13,14,16,17,19,26,27,28,30,31,33,35,39,44,45,46,48,53,
%T 55,56,57,60,62,64,65,68,69,70,71,75,76,77,78,80,83,85,86,90,93,94,96,
%U 99,100,103,105,110,111,114,115,117,119,120,125,126,130,134,140,143,144
%N Numbers k such that exactly one of k^2 + k - 1 and k^2 + k + 1 is prime.
%C Numbers k such that either k-th oblong number-+1 is prime.
%C Indices k such that A002378(k)+1 or A002378(k)-1 is prime, but not both. -_R. J. Mathar_, Feb 21 2010
%H Robert Israel, <a href="/A173297/b173297.txt">Table of n, a(n) for n = 1..10000</a>
%p isA173297 := proc(n) local p,pplus,pmin ; pmin := isprime(n*(1+n)-1) ; pplus := isprime(n*(1+n)+1) ; if pmin <> pplus then return true; else return false; end if; end proc: for n from 1 to 300 do if isA173297(n) then printf("%d,",n) ; end if; end do ; # _R. J. Mathar_, Feb 21 2010
%Y Cf. A002378, A088485.
%K nonn,easy
%O 1,2
%A _Juri-Stepan Gerasimov_, Feb 15 2010
%E 46 and 86 inserted by _R. J. Mathar_, Feb 21 2010
%E Edited by _Charles R Greathouse IV_, Mar 24 2010