OFFSET
0,3
COMMENTS
By definition a(n) is also the number of 2-dense sublists of divisors of the n-th generalized hexagonal number.
In a sublist of divisors of k the terms are in increasing order and two adjacent terms are the same two adjacent terms in the list of divisors of k.
The 2-dense sublists of divisors of k are the maximal sublists whose terms increase by a factor of at most 2.
Conjecture: all odd indexed terms are odd.
For odd n = 2k + 1 the n-th triangular number t(n) = (2k+1)*(k+1) satisfies A003056(t(n)) = 2k + 1; i.e., n is an odd divisor of t(n). Therefore SRS(t(n)) at the diagonal is positive and SRS(t(n)) has an odd number of parts. Since the number of parts equals the number of 2-dense sublists (see link in A384149), the conjecture is true. - Hartmut F. W. Hoft, Mar 25 2026
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..10000
EXAMPLE
For n = 5 the 5th triangular number is 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], so a(5) = 3.
For n = 12 the 12th triangular number is 78. The list of divisors of 78 is [1, 2, 3, 6, 13, 26, 39, 78]. There are two 2-dense sublists of divisors of 78, they are [1, 2, 3, 6] and [13, 26, 39, 78], so a(12) = 2. Note that 78 is also the first practical number A005153 not in the sequence of the 2-dense numbers A174973.
MATHEMATICA
A384928[n_] := Length[Split[Divisors[PolygonalNumber[n]], #2 <= 2*# &]];
Array[A384928, 100, 0] (* Paolo Xausa, Aug 14 2025 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Omar E. Pol, Aug 08 2025
STATUS
approved
