|
%I #12 Jun 03 2015 06:30:33
%S 1,2,3,6,12,27,48,130,252,705,1386,2295,7125,17316,31959,51054,74601,
%T 102600,351315,748440,2123189,4198848,6975417,10452896,14631285,
%U 19510584,25090793,31371912,38353941,46036880,54420729,63505488,73291157
%N Numbers m such that A186711(m) = 1.
%C Greatest common divisor of A003586(a(n)) and A003586(a(n)+1)) = 1;
%C A186927(n) = A003586(a(n)); A186928(n) = A003586(a(n) + 1).
%e n = 12, a(12) = 2295:
%e A003586(2295) = 19342813113834066795298816 = 2^84,
%e A003586(2296) = 19383245667680019896796723 = 3^53 and GCD(2^84,3^53)=1.
%o (Haskell)
%o import Data.List (findIndices)
%o a186771 n = a186771_list !! (n-1)
%o a186771_list = map (+ 1) $ findIndices (== 1) a186711_list
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Feb 26 2011
%E a(22)-a(33) from _Donovan Johnson_, Mar 04 2011
|
