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.

A332797 Numbers whose smallest prime factor is 23.

Original entry on oeis.org

23, 529, 667, 713, 851, 943, 989, 1081, 1219, 1357, 1403, 1541, 1633, 1679, 1817, 1909, 2047, 2231, 2323, 2369, 2461, 2507, 2599, 2921, 3013, 3151, 3197, 3427, 3473, 3611, 3749, 3841, 3979, 4117, 4163, 4393, 4439, 4531, 4577, 4853, 5129, 5221, 5267, 5359, 5497
Offset: 1

Views

Author

Frank Ellermann, Feb 24 2020

Keywords

Comments

The asymptotic density of this sequence is 55296/7436429. - Amiram Eldar, Dec 06 2020

Examples

			a(2) = 23*23, a(3) = 23*29.
		

References

  • Emmanuel Desurvire, Classical and Quantum Information Theory: An Introduction for the Telecom Scientist, Cambridge University Press, 2009, table 20.5 p. 421.

Crossrefs

Cf. A084967 (5), A084968 (7), A084969 (11), A084970 (13), A332799 (17), A332798 (19), A166063 (23-rough numbers).

Programs

  • Mathematica
    23 * Select[Range[240], CoprimeQ[#, 9699690] &] (* Amiram Eldar, Feb 24 2020 *)
    Select[Range[6000],FactorInteger[#][[1,1]]==23&] (* Harvey P. Dale, Aug 29 2025 *)
  • Rexx
    P = 23         ;  S = P
    do N = P by 2 while length( S ) < 255
       do I = 1 until P = X
          X = PRIME( I )
          if P = X       then  leave I
          if N // X = 0  then  iterate N
       end I
       S = S || ',' P*N
    end N
    say S          ;  return S

Formula

a(n) = 23*A166063(n).