login
A386992
Irregular triangle read by rows: T(n,k) is the number of nonprimes in the k-th 2-dense sublist of divisors of n, with n >= 1, k >= 1.
14
1, 1, 1, 0, 2, 1, 0, 2, 1, 0, 3, 1, 0, 1, 1, 1, 1, 0, 4, 1, 0, 1, 1, 1, 0, 1, 4, 1, 0, 4, 1, 0, 4, 1, 0, 0, 1, 1, 1, 1, 0, 6, 1, 0, 1, 1, 1, 1, 0, 1, 1, 4, 1, 0, 5, 1, 0, 5, 1, 0, 0, 1, 1, 1, 1, 0, 1, 7, 1, 0, 1, 1, 1, 0, 0, 1, 6, 1, 0, 5, 1, 0, 2, 2, 1, 2, 1, 1, 1, 1, 0, 8, 1, 0, 1, 1, 1, 2, 1, 0, 0, 1, 2, 2, 1, 0
OFFSET
1,5
COMMENTS
In a sublist of divisors of n the terms are in increasing order and two adjacent terms are the same two adjacent terms in the list of divisors of n.
The 2-dense sublists of divisors of n are the maximal sublists whose terms increase by a factor of at most 2.
It is conjectured that row lengths are given by A237271.
LINKS
Paolo Xausa, Table of n, a(n) for n = 1..10607 (rows 1..3500 of triangle, flattened).
FORMULA
T(n,k) = A384222(n,k) - A387030(n,k).
EXAMPLE
Triangle begins:
1;
1;
1, 0;
2;
1, 0;
2;
1, 0;
3;
1, 0, 1;
1, 1;
1, 0;
4;
1, 0;
1, 1;
1, 0, 1;
...
For n = 10 the list of divisors of 10 is [1, 2, 5, 10]. There are two 2-dense sublists of divisors of 10, they are [1, 2] and [5, 10]. There is a nonprime number in each sublist, so row 10 is [1, 1].
For n = 15 the list of divisors of 15 is [1, 3, 5, 15]. There are three 2-dense sublists of divisors of 15, they are [1], [3, 5], [15]. Only the first and the third sublists contain nonprimes, so row 15 is [1, 0, 1].
MATHEMATICA
A386992row[n_] := Map[Count[#, _?(!PrimeQ[#] &)] &, Split[Divisors[n], #2 <= 2*# &]];
Array[A386992row, 50] (* Paolo Xausa, Aug 28 2025 *)
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Omar E. Pol, Aug 23 2025
STATUS
approved