|
|
A343816
|
|
a(n) is the least start of exactly n consecutive odd numbers that are cyclic numbers (A003277).
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The sequence is restricted to odd cyclic numbers since 2 is the only even cyclic number.
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
|
|
LINKS
|
|
|
EXAMPLE
|
a(1) = 23 since 23 is cyclic, but 21 and 25 are not.
a(2) = 41 since 41 and 43 are cyclic, but 39 and 45 are not.
|
|
MATHEMATICA
|
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]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|