%I A001914 M2940 N1183
%S A001914 2,13,31,43,67,71,83,89,107,151,157,163,191,197,199,227,283,293,307,311,
%T A001914 347,359,373,401,409,431,439,443,467,479,523,557,563,569,587,599,601,
%U A001914 631,653,677,683,719,761,787,827,839,877,881,883,911,919,929,947,991
%N A001914 Cyclic numbers: 10 is a quadratic residue modulo p and class of mantissa 
               is 2.
%C A001914 Also, primes p for which the repunit (A002275) R((p-1)/2)=(10^((p-1)/
               2)-1)/9 is the smallest repunit divisible by p. Primes for which 
               A000040(n)=2*A071126(n)+1. - Hugo Pfoertner (hugo(AT)pfoertner.org), 
               Mar 18 2003
%D A001914 Albert H. Beiler, Recreations in the Theory of Numbers, 2nd ed. New York: 
               Dover, 1966. Pages 65, 309.
%D A001914 M. Kraitchik, Recherches sur la Th\'{e}orie des Nombres. Gauthiers-Villars, 
               Paris, Vol. 1, 1924, Vol. 2, 1929, see Vol. 1, p. 61.
%D A001914 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A001914 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%e A001914 The repunit R(6)=111111 is the smallest repunit divisible by the prime 
               a(2)=13=2*6+1.
%Y A001914 Cf. A003277 for another sequence of cyclic numbers.
%Y A001914 Cf. A000040, A002275, A071126.
%Y A001914 Sequence in context: A031414 A030452 A132602 this_sequence A031392 A156980 
               A158720
%Y A001914 Adjacent sequences: A001911 A001912 A001913 this_sequence A001915 A001916 
               A001917
%K A001914 nonn
%O A001914 1,1
%A A001914 N. J. A. Sloane (njas(AT)research.att.com).
%E A001914 More terms from Enoch Haga (Enokh(AT)comcast.net).