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.

A356224 Number of divisors of n whose prime indices cover an initial interval of positive integers.

Original entry on oeis.org

1, 2, 1, 3, 1, 3, 1, 4, 1, 2, 1, 5, 1, 2, 1, 5, 1, 4, 1, 3, 1, 2, 1, 7, 1, 2, 1, 3, 1, 4, 1, 6, 1, 2, 1, 7, 1, 2, 1, 4, 1, 3, 1, 3, 1, 2, 1, 9, 1, 2, 1, 3, 1, 5, 1, 4, 1, 2, 1, 7, 1, 2, 1, 7, 1, 3, 1, 3, 1, 2, 1, 10, 1, 2, 1, 3, 1, 3, 1, 5, 1, 2, 1, 5, 1, 2, 1
Offset: 1

Views

Author

Gus Wiseman, Aug 04 2022

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

Examples

			The a(n) gapless divisors of n = 1..24:
  1  2  1  4  1  6  1  8  1  2  1  12  1  2  1  16  1  18  1  4  1  2  1  24
     1     2     2     4     1     6      1     8      6      2     1     12
           1     1     2           4            4      2      1           8
                       1           2            2      1                  6
                                   1            1                         4
                                                                          2
                                                                          1
For example, the divisors of 12 are {1,2,3,4,6,12}, of which {1,2,4,6,12} belong to A055932, so a(12) = 5.
		

Crossrefs

These divisors belong to A055932, a subset of A073491 (complement A073492).
The complement is A356225.
A001223 lists the prime gaps.
A328338 has third-largest divisor prime.
A356226 gives the lengths of maximal gapless intervals of prime indices.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    normQ[m_]:=m=={}||Union[m]==Range[Max[m]];
    Table[Length[Select[Divisors[n],normQ[primeMS[#]]&]],{n,100}]