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.

A040017 Prime 3 followed by unique period primes (the period r of 1/p is not shared with any other prime) of the form A019328(r)/gcd(A019328(r),r) in order (periods r are given in A051627).

Original entry on oeis.org

3, 11, 37, 101, 9091, 9901, 333667, 909091, 99990001, 999999000001, 9999999900000001, 909090909090909091, 1111111111111111111, 11111111111111111111111, 900900900900990990990991, 909090909090909090909090909091
Offset: 1

Views

Author

Keywords

Comments

Prime p=3 is the only known example of a unique period prime such that A019328(r)/gcd(A019328(r),r) = p^k with k > 1 (cf. A323748). It is plausible to assume that no other such prime exists. Under this (unproved) assumption, the current sequence lists all unique period primes in order and represents a sorted version of A007615. - Max Alekseyev, Oct 14 2022

Examples

			The decimal expansion of 1/101 is 0.00990099..., having a period of 4 and it is the only prime with that period.
		

References

  • J.-P. Delahaye, Merveilleux nombres premiers ("Amazing primes"), p. 324, Pour la Science Paris 2000.

Crossrefs

Programs

  • Mathematica
    lst = {}; Do[c = Cyclotomic[n, 10]; q = c/GCD[c, n]; If[PrimeQ[q], AppendTo[lst, q]], {n, 62}]; Prepend[Sort[lst], 3] (* Arkadiusz Wesolowski, May 13 2012 *)

Formula

For n >= 2, a(n) = A019328(r) / gcd(A019328(r), r), where r = A051627(n). - Max Alekseyev, Oct 14 2022

Extensions

Missing term a(45) inserted in b-file at the suggestion of Eric Chen by Max Alekseyev, Oct 13 2022
Edited by Max Alekseyev, Oct 14 2022