a(n)=least number m such that gcd(prime(m)+2,prime(m+1)+2) = 2*n-1.
A268863
a(n)=least number m such that gcd(prime(m)+2,prime(m+1)+2) = 2*n-1.
Terms
- a(0) =1a(1) =11a(2) =61a(3) =350a(4) =180a(5) =1010a(6) =1933a(7) =1006a(8) =8555a(9) =4154a(10) =12089a(11) =9696a(12) =37932a(13) =14173a(14) =43447a(15) =39464a(16) =24706a(17) =129178a(18) =74854a(19) =59257a(20) =95206a(21) =531300a(22) =88480a(23) =1280569a(24) =934602a(25) =818760a(26) =85633a(27) =232992a(28) =2236506a(29) =953991
External references
- oeis: A268863