%I #15 May 10 2021 15:14:48
%S 23,41,177,1,11,877,2387,695
%N a(n) is the least start of exactly n consecutive odd numbers that are cyclic numbers (A003277).
%C The sequence is restricted to odd cyclic numbers since 2 is the only even cyclic number.
%C This sequence is finite, with 8 terms; any run of 9 consecutive odd numbers will contain a multiple of 9, and this multiple of 9 cannot be cyclic. - _Rémy Sigrist_, May 10 2021
%e a(1) = 23 since 23 is cyclic, but 21 and 25 are not.
%e a(2) = 41 since 41 and 43 are cyclic, but 39 and 45 are not.
%t cycQ[n_] := CoprimeQ[n, EulerPhi[n]]; seq[m_] := Module[{s = Table[0, {m}], c = 0, n = 1, n1, d}, While[c < m, n1 = n; If[cycQ[n], While[n1 += 2; cycQ[n1]]; d = (n1 - n)/2; If[d <= m && s[[d]] == 0, c++; s[[d]] = n]]; n = n1 + 2]; s]; seq[8]
%Y Cf. A003277, A343815.
%K nonn,fini,full
%O 1,1
%A _Amiram Eldar_, Apr 30 2021