OFFSET
1,3
COMMENTS
Analogous to A162306 regarding m such that rad(m) | n, but instead of taking m <= n, we take m such that bigomega(m) <= bigomega(n).
Row n is a finite set of products of prime power factors p^k (i.e., p^k | n) such that Sum_{p|n} k <= bigomega(n).
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..17475 (rows n = 1..1000, flattened)
Michael De Vlieger, Log log scatterplot of rows n = 1..2^16 of this sequence, flattened, (3153752 terms).
FORMULA
EXAMPLE
Triangle begins:
n row n of this sequence:
-------------------------------------------
1: 1;
2: 1, 2;
3: 1, 3;
4: 1, 2 4;
5: 1, 5;
6: 1, 2, 3, 4, 6, 9;
7: 1, 7;
8: 1, 2, 4, 8;
9: 1, 3, 9;
10: 1, 2, 4, 5, 10, 25;
11: 1, 11;
12: 1, 2, 3, 4, 6, 8, 9, 12, 18, 27;
...
Row n = 10 of this sequence, presented according to 2^k, k = 0..bigomega(n) by columns, 5^i, i = 0..bigomega(n) by rows, showing terms m > n with an asterisk. The remaining m and the parenthetic 8 are in row 10 of A162306:
1 2 4 (8)
5 10
25*
Row n = 12 of this sequence, presented according to 2^k, k = 0..bigomega(n) by columns, 3^i, i = 0..bigomega(n) by rows, showing terms m > n with an asterisk. The remaining m are in row 12 of A162306:
1 2 4 8
3 6 12
9 18*
27*
MATHEMATICA
Table[Clear[p]; MapIndexed[Set[p[First[#2]], #1] &, FactorInteger[n][[All, 1]]]; k = PrimeOmega[n]; w = PrimeNu[n]; Union@ Map[Times @@ MapIndexed[p[First[#2]]^#1 &, #] &, Select[Tuples[Range[0, k], w], Total[#] <= k &] ], {n, 120}]
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Michael De Vlieger, Oct 09 2024
STATUS
approved