|
|
A374433
|
|
Triangle read by rows: T(n, k) = Product_{p in PF(n) intersect PF(k)} p, where PF(a) is the set of the prime factors of a.
|
|
8
|
|
|
1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 5, 1, 1, 2, 3, 2, 1, 6, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
[ 0] 1;
[ 1] 1, 1;
[ 2] 1, 1, 2;
[ 3] 1, 1, 1, 3;
[ 4] 1, 1, 2, 1, 2;
[ 5] 1, 1, 1, 1, 1, 5;
[ 6] 1, 1, 2, 3, 2, 1, 6;
[ 7] 1, 1, 1, 1, 1, 1, 1, 7;
[ 8] 1, 1, 2, 1, 2, 1, 2, 1, 2;
[ 9] 1, 1, 1, 3, 1, 1, 3, 1, 1, 3;
[10] 1, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10;
[11] 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11;
|
|
MAPLE
|
PF := n -> ifelse(n = 0, {}, NumberTheory:-PrimeFactors(n)):
A374433 := (n, k) -> mul(PF(n) intersect PF(k)):
seq(seq(A374433(n, k), k = 0..n), n = 0..12);
|
|
MATHEMATICA
|
nn = 12; Do[Set[s[i], FactorInteger[i][[All, 1]]], {i, 0, nn}]; s[0] = {1};
Table[Times @@ Intersection[s[k], s[n]], {n, 0, nn}, {k, 0, n}] // Flatten (* Michael De Vlieger, Jul 11 2024 *)
|
|
PROG
|
(Python)
from math import prod
from sympy import primefactors
def PF(n): return set(primefactors(n)) if n > 0 else set({})
def PrimeIntersect(n, k): return prod(PF(n).intersection(PF(k)))
def PrimeSymDiff(n, k): return prod(PF(n).symmetric_difference(PF(k)))
def PrimeUnion(n, k): return prod(PF(n).union(PF(k)))
def PrimeDiff(n, k): return prod(PF(n).difference(PF(k)))
for n in range(11): print([A374433(n, k) for k in range(n + 1)])
|
|
CROSSREFS
|
Family: this sequence (intersection), A374434 (symmetric difference), A374435 (difference), A374436 (union).
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|