Search: id:A001912
Results 1-1 of 1 results found.

%I A001912 M0636 N0232
%S A001912 1,2,3,5,7,8,10,12,13,18,20,27,28,33,37,42,45,47,55,58,60,62,63,
%T A001912 65,67,73,75,78,80,85,88,90,92,102,103,105,112,115,118,120,125,
%U A001912 128,130,132,135,140,142,150,153,157,163,170,175,192,193,198,200
%N A001912 Numbers n such that 4*n^2 + 1 is prime.
%D A001912 E. Kogbetliantz and A. Krikorian, Handbook of First Complex Prime Numbers, 
               Gordon and Breach, NY, 1971, p. 1.
%D A001912 M. Kraitchik, Recherches sur la Th\'{e}orie des Nombres. Gauthiers-Villars, 
               Paris, Vol. 1, 1924, Vol. 2, 1929, see Vol. 1, p. 11.
%D A001912 C. S. Ogilvy, Tomorrow's Math. 2nd ed., Oxford Univ. Press, 1972, p. 
               116.
%D A001912 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A001912 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A001912 T. D. Noe, <a href="b001912.txt">Table of n, a(n) for n=1..10000</a>
%H A001912 Marek Wolf, <a href="http://arXiv.org/abs/0803.1456">Search for primes 
               of the form m^2+1</a>
%F A001912 a(n) = A005574(n+1)/2.
%t A001912 lst={};Do[If[PrimeQ[4*n^2+1], AppendTo[lst, n]], {n, 6!}];lst [From Vladimir 
               Orlovsky (4vladimir(AT)gmail.com), Sep 04 2008]
%Y A001912 Cf. A002496, A005574, A062325, A090693.
%Y A001912 Sequence in context: A047222 A028763 A143826 this_sequence A083027 A060107 
               A159556
%Y A001912 Adjacent sequences: A001909 A001910 A001911 this_sequence A001913 A001914 
               A001915
%K A001912 nonn,easy,nice
%O A001912 1,2
%A A001912 N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.002 seconds