cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A343816 a(n) is the least start of exactly n consecutive odd numbers that are cyclic numbers (A003277).

Original entry on oeis.org

23, 41, 177, 1, 11, 877, 2387, 695
Offset: 1

Views

Author

Amiram Eldar, Apr 30 2021

Keywords

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

Examples

			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.

Crossrefs

Cf. A003277, A343815.

Programs

  • 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]
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.