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 A368194 #13 Dec 22 2023 11:39:30 %S A368194 1,1,2,1,3,1,2,4,1,5,1,2,3,6,1,7,1,2,4,8,1,3,9,1,2,5,10,1,11,1,2,3,4, %T A368194 6,11,12,1,11,13,1,2,7,11,12,14,1,3,5,11,15,1,2,4,8,11,12,13,16,1,11, %U A368194 17,1,2,3,6,9,11,12,14,18,1,11,13,19,1,2,4,5,10,20 %N A368194 Irregular table T(n, k), n > 0, k = 1..A368195(n), read by rows: the n-th row lists the numbers that can be obtained by replacing any positive number without leading zeros, say m, appearing in the decimal expansion of n by one of the divisors of m. %C A368194 The n-th row starts with 1, ends with n, and contains the divisors of n (A027750). %H A368194 Rémy Sigrist, <a href="/A368194/b368194.txt">Table of n, a(n) for n = 1..16938</a> (rows for n = 1..1000 flattened) %H A368194 Rémy Sigrist, <a href="/A368194/a368194.gp.txt">PARI program</a> %H A368194 <a href="/index/De#decimal_expansion">Index entries for sequences related to decimal expansion of n</a> %F A368194 T(n, 1) = 1. %F A368194 T(n, A368195(n)) = n. %e A368194 Table T(n, k) begins: %e A368194 1; %e A368194 1, 2; %e A368194 1, 3; %e A368194 1, 2, 4; %e A368194 1, 5; %e A368194 1, 2, 3, 6; %e A368194 1, 7; %e A368194 1, 2, 4, 8; %e A368194 1, 3, 9; %e A368194 1, 2, 5, 10; %e A368194 1, 11; %e A368194 1, 2, 3, 4, 6, 11, 12; %e A368194 1, 11, 13; %e A368194 1, 2, 7, 11, 12, 14; %e A368194 1, 3, 5, 11, 15; %e A368194 1, 2, 4, 8, 11, 12, 13, 16; %e A368194 1, 11, 17; %e A368194 1, 2, 3, 6, 9, 11, 12, 14, 18; %e A368194 ... %o A368194 (PARI) See Links section. %Y A368194 Cf. A027750, A323286, A342072, A368195, A368313 (binary variant). %K A368194 nonn,base,tabf %O A368194 1,3 %A A368194 _Rémy Sigrist_, Dec 16 2023