Search: id:A067063 Results 1-1 of 1 results found. %I A067063 %S A067063 11,3,11,41,3,239,11,3,11,21649,3,53,11,3,11,2071723,3, %T A067063 1111111111111111111,11,3,11,11111111111111111111111,3,41,11,3,11,3191, %U A067063 3,2791,11,3,11,41,3,2028119,11,3,11,83,3,173,11,3,11,35121409,3,239 %N A067063 Smallest prime factor of repunit(n) = (10^n-1)/9 (A002275). %C A067063 a(3n) = 3, a(6n-4) = a(6n-2) = 11, a(30n-25) = a(30n-5) = 41, ... - M. F. Hasler (Maximilian.Hasler(AT)gmail.com), Nov 21 2006 %D A067063 Amarnath Murthy, On the divisors of Smarandache Unary Sequence, Smarandache Notions Journal, Vol. 11, No. 1-2-3, Spring 2000. %D A067063 David Wells, The Penguin Dictionary of Curious and Interesting Numbers. %H A067063 T. D. Noe, Table of n, a(n) for n=2..500 (derived from Yousuke Koide) %H A067063 M. L. Perez et al., eds., Smarandache Notions Journal %H A067063 Samuel S. Wagstaff, the Cunningham Project %H A067063 Makoto Kamada, Factorizations of 11...11 (Repunit). %H A067063 Yousuke Koide, Factorizations of Repunit Numbers %p A067063 'min(op(numtheory[factorset]((10^k-1)/9)))'$k=2..50; - M. F. Hasler (Maximilian.Hasler(AT)gmail.com), Nov 21 2006 %t A067063 a = {}; Do[a = Append[a, FactorInteger[(10^n - 1)/9][[1, 1]]], {n, 2, 111} ]; a %Y A067063 Cf. A003020, A002275, A102380. %Y A067063 Sequence in context: A082769 A110435 A110774 this_sequence A075023 A088262 A110406 %Y A067063 Adjacent sequences: A067060 A067061 A067062 this_sequence A067064 A067065 A067066 %K A067063 nonn %O A067063 2,1 %A A067063 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jan 03 2002 %E A067063 More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 04 2002 Search completed in 0.001 seconds