[go: up one dir, main page]

login
Revision History for A355739 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of ways to choose a sequence of all different divisors, one of each prime index of n (with multiplicity).
(history; published version)
#7 by Michael De Vlieger at Tue Jul 19 08:04:21 EDT 2022
STATUS

proposed

approved

#6 by Gus Wiseman at Tue Jul 19 04:14:43 EDT 2022
STATUS

editing

proposed

#5 by Gus Wiseman at Tue Jul 19 04:14:14 EDT 2022
LINKS

Wikipedia, <a href="https://en.wikipedia.org/wiki/Cartesian_product">Cartesian product</a>.

#4 by Gus Wiseman at Tue Jul 19 04:13:07 EDT 2022
CROSSREFS

This is the strict version of A355731, firsts A355732, prime factors A355741, prime powers A355742.

A289508 gives GCD of prime indices, positions of 1's A289509.

A289509 lists numbers with relatively prime prime indices.

Cf. A000720, A076610, A302796, A355535, `A355537, A355733, A355735, A355741, A355742, A355744, `A355748.

#3 by Gus Wiseman at Mon Jul 18 16:04:21 EDT 2022
NAME

Number of ways to choose a sequence of all different divisors , one of each prime index of n (with multiplicity).

EXAMPLE

The a(49) = 6 ways are: (1,2), (1,4), (2,1), (2,4), (4,1), (4,2).

CROSSREFS

For weakly increasing instead of strict we have A355735, prime factors A355745.

Cf. A000720, A076610, `~A302796, `A355535, `A355537, A355733, `A355735, A355744, `A355747, `A355748.

#2 by Gus Wiseman at Mon Jul 18 04:20:43 EDT 2022
NAME

allocated for Gus WisemanNumber of ways to choose a sequence of all different divisors of each prime index of n.

DATA

1, 1, 2, 0, 2, 1, 3, 0, 2, 1, 2, 0, 4, 2, 3, 0, 2, 0, 4, 0, 4, 1, 3, 0, 2, 3, 0, 0, 4, 1, 2, 0, 3, 1, 5, 0, 6, 3, 6, 0, 2, 1, 4, 0, 2, 2, 4, 0, 6, 0, 3, 0, 5, 0, 3, 0, 6, 3, 2, 0, 6, 1, 2, 0, 6, 1, 2, 0, 5, 2, 6, 0, 4, 5, 2, 0, 5, 2, 4, 0, 0, 1, 2, 0, 3, 3, 6

OFFSET

1,3

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.

EXAMPLE

The a(182) = 5 ways are: (1,2,3), (1,2,6), (1,4,2), (1,4,3), (1,4,6).

The a(546) = 2 ways are: (1,2,4,3), (1,2,4,6).

MATHEMATICA

primeMS[n_]:=If[n==1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];

Table[Length[Select[Tuples[Divisors/@primeMS[n]], UnsameQ@@#&]], {n, 100}]

CROSSREFS

This is the strict version of A355731, firsts A355732, prime factors A355741, prime powers A355742.

For weakly increasing instead of strict we have A355735, prime factors A355745.

For relatively prime instead of strict we have A355737, firsts A355738.

Positions of 0's are A355740.

A000005 counts divisors.

A001221 counts distinct prime factors, with sum A001414.

A001222 counts prime factors with multiplicity.

A003963 multiplies together the prime indices of n.

A056239 adds up prime indices, row sums of A112798.

A120383 lists numbers divisible by all of their prime indices.

A289508 gives GCD of prime indices.

A289509 lists numbers with relatively prime prime indices.

Cf. A000720, A076610, `~A302796, `A355535, `A355537, A355733, `A355744, `A355747, `A355748.

KEYWORD

allocated

nonn

AUTHOR

Gus Wiseman, Jul 18 2022

STATUS

approved

editing

#1 by Gus Wiseman at Fri Jul 15 21:38:32 EDT 2022
NAME

allocated for Gus Wiseman

KEYWORD

allocated

STATUS

approved