OFFSET
1,2
COMMENTS
Row n contains the positive multiples n*k for which n is the smallest divisor of n*k such that n >= sqrt(n*k). This forces 1 <= k <= n, because n >= sqrt(n*k) implies n^2 >= n*k; i.e., k <= n; and k >= 1 by definition, since n*k is a positive multiple of n.
For n > 1 the length of row n is A062854(n) = A333995(n) + A010051(n) = A027424(n) - A027424(n-1); row 1 has length 1.
Every positive integer N occurs in exactly one row, namely the row A033677(N). Thus the rows partition the positive integers N according to the value of A033677(N). Thus, the entire sequence is a permutation of the positive integers.
The initial term of row n is D(n); i.e., the smallest primitive entry in column n of the triangular multiplication table. The last term of row n is always n^2, because A033677(n^2) = n.
This triangle is distinct from A075383 where the n-th row has always exactly n terms. Here, row n consists exactly of the products that first appear when passing from the (n-1) X (n-1) multiplication table to the n X n multiplication table. The row first terms agree with A075384 for n = 1..39, but first differ at n = 40, where the row initial term here is 880 while A075384(40) = 920.
FORMULA
EXAMPLE
The first rows are:
row 1: 1;
row 2: 2, 4;
row 3: 3, 6, 9;
row 4: 8, 12, 16;
row 5: 5, 10, 15, 20, 25;
row 6: 18, 24, 30, 36;
row 7: 7, 14, 21, 28, 35, 42, 49;
row 8: 32, 40, 48, 56, 64;
row 9: 27, 45, 54, 63, 72, 81;
MATHEMATICA
row[n_] := Select[n * Range[n], Function[x, Select[Divisors[x], # >= Sqrt[x] &, 1] == {n}]]; Table[row[n], {n, 1, 13}] // Flatten (* Amiram Eldar, Jun 27 2026 *)
PROG
(PARI) f(n) = my(d=divisors(n)); d[length(d)\2+1]; \\ A033677
row(n) = select(x->f(x)==n, vector(n, k, k*n)); \\ Michel Marcus, Jul 05 2026
CROSSREFS
KEYWORD
nonn,tabf,new
AUTHOR
Charles Kusniec, Jun 23 2026
STATUS
approved
