A355733 Number of multisets that can be obtained by choosing a divisor of each prime index of n.
1, 1, 2, 1, 2, 2, 3, 1, 3, 2, 2, 2, 4, 3, 4, 1, 2, 3, 4, 2, 5, 2, 3, 2, 3, 4, 4, 3, 4, 4, 2, 1, 4, 2, 6, 3, 6, 4, 7, 2, 2, 5, 4, 2, 6, 3, 4, 2, 6, 3, 4, 4, 5, 4, 4, 3, 7, 4, 2, 4, 6, 2, 7, 1, 7, 4, 2, 2, 6, 6, 6, 3, 4, 6, 6, 4, 6, 7, 4, 2, 5, 2, 2, 5, 4, 4, 7
Offset: 1
Keywords
Examples
The a(15) = 4 multisets are: {1,1}, {1,2}, {1,3}, {2,3}. The a(18) = 3 multisets are: {1,1,1}, {1,1,2}, {1,2,2}.
Links
- Robert Price, Table of n, a(n) for n = 1..2000
- Wikipedia, Axiom of choice.
Crossrefs
Positions of first appearances are A355734.
Choosing only prime divisors gives A355744.
The version choosing a divisor of each number from 1 to n is A355747.
A000005 counts divisors.
A003963 multiplies together the prime indices of n.
A061395 selects the maximum prime index.
A120383 lists numbers divisible by all of their prime indices.
A324850 lists numbers divisible by the product of their prime indices.
A340852 lists numbers that can be factored into divisors of bigomega.
Programs
-
Mathematica
primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]; Table[Length[Union[Sort/@Tuples[Divisors/@primeMS[n]]]],{n,100}]
Comments