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.

A385757 a(n) is the smallest number having n smaller numbers with the same number of prime factors (counted with multiplicity).

Original entry on oeis.org

3, 5, 7, 11, 13, 17, 19, 23, 26, 31, 34, 35, 38, 39, 46, 49, 51, 55, 57, 58, 62, 65, 69, 74, 77, 82, 85, 86, 87, 91, 93, 94, 95, 106, 111, 115, 118, 119, 121, 122, 123, 129, 133, 134, 141, 142, 143, 145, 146, 155, 158, 159, 161, 166, 169, 177, 178, 183, 185, 187, 194, 201, 202, 203, 205
Offset: 1

Views

Author

Ilya Gutkovskiy, Jul 08 2025

Keywords

Comments

a(n) is the least number k such that A335097(k) = n.

Examples

			The smallest number having 9 smaller numbers (4, 6, 9, 10, 14, 15, 21, 22 and 25) with the same number of prime factors (counted with multiplicity) is 26, so a(9) is 26.
		

Crossrefs

Programs

  • Mathematica
    a[n_]:=Module[{k = 1, m, cnt}, While[True,m = PrimeOmega[k];cnt = Sum[Boole[PrimeOmega[i] == m], {i, 2, k - 1}];If[cnt == n, Return[k]];k++ ]];Array[a,65] (* James C. McMahon, Jul 13 2025 *)
  • PARI
    a(n) = my(k=2, m=bigomega(k)); while (sum(i=2, k-1, bigomega(i) == m) !=n, k++; m=bigomega(k)); k; \\ Michel Marcus, Jul 09 2025
Showing 1-1 of 1 results.