A212119 Triangle read by rows T(n,k), n>=1, k>=1, where T(n,k) is the number of divisors d of n with min(d, n/d) = k.
1, 2, 2, 2, 1, 2, 0, 2, 2, 2, 0, 2, 2, 2, 0, 1, 2, 2, 0, 2, 0, 0, 2, 2, 2, 2, 0, 0, 2, 2, 0, 2, 0, 2, 2, 2, 0, 1, 2, 0, 0, 0, 2, 2, 2, 0, 2, 0, 0, 0, 2, 2, 0, 2, 2, 0, 2, 0, 2, 2, 0, 0, 2, 0, 0, 0, 2, 2, 2, 2, 2, 0, 0, 0, 1, 2, 2, 0, 0, 0, 2, 0, 2, 0, 0
Offset: 1
Examples
Row 10 gives 2, 2, 0 therefore the sums of row 10 is 2+2+0 = 4, the same as A000005(10), the number of divisors of 10. Written as an irregular triangle the sequence begins: 1; 2; 2; 2, 1; 2, 0; 2, 2; 2, 0; 2, 2; 2, 0, 1; 2, 2, 0; 2, 0, 0; 2, 2, 2; 2, 0, 0; 2, 2, 0; 2, 0, 2; 2, 2, 0, 1; 2, 0, 0, 0; 2, 2, 2, 0; 2, 0, 0, 0; 2, 2, 0, 2; 2, 0, 2, 0; 2, 2, 0, 0; 2, 0, 0, 0; 2, 2, 2, 2; 2, 0, 0, 0, 1;
Links
- Omar E. Pol, Diagram of divisors, figure 1, figure 2
- Omar E. Pol, Illustration of initial terms and of row sums
Crossrefs
Extensions
Definition changed by Franklin T. Adams-Watters, Jul 12 2012
Comments