This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A384222 #105 Aug 22 2025 00:14:43 %S A384222 1,2,1,1,3,1,1,4,1,1,4,1,1,1,2,2,1,1,6,1,1,2,2,1,2,1,5,1,1,6,1,1,6,1, %T A384222 1,1,1,2,2,1,1,8,1,1,1,2,2,1,1,1,1,6,1,1,8,1,1,6,1,1,1,1,2,2,1,2,1,9, %U A384222 1,1,2,2,1,1,1,1,8,1,1,8,1,1,3,3,1,4,1,2,2,1,1,10,1,1,1,2,2,2,1,1,1,1,3,3,1,1,8 %N A384222 Irregular triangle read by rows: T(n,k) is the length of the k-th 2-dense sublist of divisors of n, with n >= 1, k >= 1. %C A384222 The 2-dense sublists of divisors of n are the maximal sublists whose terms increase by a factor of at most 2. %C A384222 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. %C A384222 Row n has only one term, which is A000005(n), if and only if n is in A174973. %C A384222 Conjecture 1: row n is a palindromic composition of A000005(n). %C A384222 If the conjecture is true then this triangle should be a companion of A237270 in the sense that here the n-th row should be a palindromic composition of sigma_0(n) = A000005(n) and the n-th row of A237270 is a palindromic composition of sigma_1(n) = A000203(n). %C A384222 A384149(n,k) is the sum of the terms in the k-th sublist of divisors of n. In the comments of A384149 it is conjectured that the row lengths of that triangle give A237271. If that conjecture is true then here the row lengths should also be A237271 and therefore A237271(n) could be defined also as the number of 2-dense sublists of divisors of n. %H A384222 Paolo Xausa, <a href="/A384222/b384222.txt">Table of n, a(n) for n = 1..10607</a> (rows 1..3500 of triangle, flattened). %e A384222 ---------------------------------------------------------------- %e A384222 | n | Row n of | List of divisors of n | Number of | %e A384222 | | the triangle | [with sublists in brackets] | sublists | %e A384222 ---------------------------------------------------------------- %e A384222 | 1 | 1; | [1]; | 1 | %e A384222 | 2 | 2; | [1, 2]; | 1 | %e A384222 | 3 | 1, 1; | [1], [3]; | 2 | %e A384222 | 4 | 3; | [1, 2, 4]; | 1 | %e A384222 | 5 | 1, 1; | [1], [5]; | 2 | %e A384222 | 6 | 4; | [1, 2, 3, 6]; | 1 | %e A384222 | 7 | 1, 1; | [1], [7]; | 2 | %e A384222 | 8 | 4; | [1, 2, 4, 8]; | 1 | %e A384222 | 9 | 1, 1, 1; | [1], [3], [9]; | 3 | %e A384222 | 10 | 2, 2; | [1, 2], [5, 10]; | 2 | %e A384222 | 11 | 1, 1; | [1], [11]; | 2 | %e A384222 | 12 | 6; | [1, 2, 3, 4, 6, 12]; | 1 | %e A384222 | 13 | 1, 1; | [1], [13]; | 2 | %e A384222 | 14 | 2, 2; | [1, 2], [7, 14]; | 2 | %e A384222 | 15 | 1, 2, 1; | [1], [3, 5], [15]; | 3 | %e A384222 | 16 | 5; | [1, 2, 4, 8, 16]; | 1 | %e A384222 | 17 | 1, 1; | [1], [17]; | 2 | %e A384222 | 18 | 6; | [1, 2, 3, 6, 9, 18]; | 1 | %e A384222 | 19 | 1, 1; | [1], [19]; | 2 | %e A384222 | 20 | 6; | [1, 2, 4, 5, 10, 20]; | 1 | %e A384222 | 21 | 1, 1, 1, 1; | [1], [3], [7], [21]; | 4 | %e A384222 | 22 | 2, 2; | [1, 2], [11, 22]; | 2 | %e A384222 | 23 | 1, 1; | [1], [23]; | 2 | %e A384222 | 24 | 8; | [1, 2, 3, 4, 6, 8, 12, 24]; | 1 | %e A384222 ... %e A384222 ... %e A384222 For n = 14 the list of divisors of 14 is [1, 2, 7, 14]. There are two sublists of divisors of 14 whose terms increase by a factor of at most 2, they are [1, 2] and [7, 14]. Each sublist has two terms, so the row 14 is [2, 2]. %e A384222 For n = 15 the list of divisors of 15 is [1, 3, 5, 15]. There are three sublists of divisors of 15 whose terms increase by a factor of at most 2, they are [1], [3, 5], [15]. The number of terms in the sublists are [1, 2, 1] respectively, so the row 15 is [1, 2, 1]. %e A384222 78 is the first practical number A005153 not in A174973. For n = 78 the list of divisors of 78 is [1, 2, 3, 6, 13, 26, 39, 78]. There are two sublists of divisors of 78 whose terms increase by a factor of at most 2, they are [1, 2, 3, 6] and [13, 26, 39, 78]. The number of terms in the sublists are [4, 4] respectively, so the row 78 is [4, 4]. %e A384222 From _Omar E. Pol_, Jul 23 2025: (Start) %e A384222 A visualization with symmetries of the list of divisors of the first 24 positive integers and the sublists of divisors is as shown below: %e A384222 --------------------------------------------------------------------------------- %e A384222 | n | List of divisors of n | Number of | %e A384222 | | [with sublists of divisors in brackets] | sublists | %e A384222 --------------------------------------------------------------------------------- %e A384222 | 1 | [1] | 1 | %e A384222 | 2 | [1 2] | 1 | %e A384222 | 3 | [1] [3] | 2 | %e A384222 | 4 | [1 2 4] | 1 | %e A384222 | 5 | [1] [5] | 2 | %e A384222 | 6 | [1 2 3 6] | 1 | %e A384222 | 7 | [1] [7] | 2 | %e A384222 | 8 | [1 2 4 8] | 1 | %e A384222 | 9 | [1] [3] [9] | 3 | %e A384222 | 10 | [1 2] [5 10] | 2 | %e A384222 | 11 | [1] [11] | 2 | %e A384222 | 12 | [1 2 3 4 6 12] | 1 | %e A384222 | 13 | [1] [13] | 2 | %e A384222 | 14 | [1 2] [7 14] | 2 | %e A384222 | 15 | [1] [3 5] [15] | 3 | %e A384222 | 16 | [1 2 4 8 16] | 1 | %e A384222 | 17 | [1] [17] | 2 | %e A384222 | 18 | [1 2 3 6 9 18] | 1 | %e A384222 | 19 | [1] [19] | 2 | %e A384222 | 20 | [1 2 4 5 10 20] | 1 | %e A384222 | 21 | [1] [3] [7] [21] | 4 | %e A384222 | 22 | [1 2] [11 22] | 2 | %e A384222 | 23 | [1] [23] | 2 | %e A384222 | 24 | [1 2 3 4 6 8 12 24] | 1 | %e A384222 ... %e A384222 A similar structure show the positive integers in the square array A385000. (End) %t A384222 A384222row[n_] := Map[Length, Split[Divisors[n], #2/# <= 2 &]]; %t A384222 Array[A384222row, 50] (* _Paolo Xausa_, Jul 08 2025 *) %Y A384222 Row sums give A000005. %Y A384222 Cf. A000203, A005153, A027750, A174973 (2-dense numbers), A237271, A379288, A384149, A384225, A384226, A384928, A384930, A384931, A385000, A386984, A386989, A387030. %K A384222 nonn,tabf,changed %O A384222 1,2 %A A384222 _Omar E. Pol_, Jun 03 2025