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 A239313 #20 Apr 20 2016 00:33:09 %S A239313 0,0,1,1,2,0,3,3,4,0,1,5,5,0,6,0,0,7,7,3,8,0,0,1,9,9,0,0,10,0,5,0,11, %T A239313 11,0,0,12,0,0,3,13,13,7,0,1,14,0,0,0,0,15,15,0,0,0,16,0,9,5,0,17,17, %U A239313 0,0,0,18,0,0,0,3,19,19,11,0,0,1,20,0,0,7,0,0 %N A239313 Triangle read by rows: T(n,k), n>=1, k>=1, in which column k lists the odd numbers interleaved with k-1 zeros, except the first column which lists 0 together with the nonnegative integers, and the first element of column k is in row k*(k+1)/2. %C A239313 Alternating row sums give the Chowla's function, i.e., sum_{k=1..A003056(n)} (-1)^(k-1)*T(n,k) = A048050(n). %C A239313 Row n has length A003056(n) hence column k starts in row A000217(k). %C A239313 Column 1 gives 0 together with A001477. %C A239313 Column 2 is A193356. %C A239313 The number of positive terms in row n is A001227(n), if n >= 3. - _Omar E. Pol_, Apr 18 2016 %F A239313 T(n,k) = A196020(n,k), if k >= 2. - _Omar E. Pol_, Apr 18 2016 %e A239313 Triangle begins (row n = 1..24): %e A239313 0; %e A239313 0; %e A239313 1, 1; %e A239313 2, 0; %e A239313 3, 3; %e A239313 4, 0, 1; %e A239313 5, 5, 0; %e A239313 6, 0, 0; %e A239313 7, 7, 3; %e A239313 8, 0, 0, 1; %e A239313 9, 9, 0, 0; %e A239313 10, 0, 5, 0; %e A239313 11, 11, 0, 0; %e A239313 12, 0, 0, 3; %e A239313 13, 13, 7, 0, 1; %e A239313 14, 0, 0, 0, 0; %e A239313 15, 15, 0, 0, 0; %e A239313 16, 0, 9, 5, 0; %e A239313 17, 17, 0, 0, 0; %e A239313 18, 0, 0, 0, 3; %e A239313 19, 19, 11, 0, 0, 1; %e A239313 20, 0, 0, 7, 0, 0; %e A239313 21, 21, 0, 0, 0, 0; %e A239313 22, 0, 13, 0, 0, 0; %e A239313 ... %e A239313 For n = 15 the divisors of 15 are 1, 3, 5, 15 therefore the sum of divisors of 15 except 1 and 15 is 3 + 5 = 8. On the other hand the 15th row of triangle is 13, 13, 7, 0, 1, hence the alternating row sum is 13 - 13 + 7 - 0 + 1 = 8, equalling the sum of divisors of 15 except 1 and 15. %e A239313 If n is even then the alternating sum of the n-th row of triangle is simpler than the sum of divisors of n, except 1 and n. Example: the sum of divisors of 24 except 1 and 24 is 2 + 3 + 4 + 6 + 8 + 12 = 35, and the alternating sum of the 24th row of triangle is 22 - 0 + 13 - 0 + 0 - 0 = 35. %Y A239313 Cf. A000203, A000217, A001065, A001227, A001477, A193356, A196020, A211343, A212119, A228813, A231345, A231347, A235791, A235794, A236104, A236106, A236112. %K A239313 nonn,tabf %O A239313 1,5 %A A239313 _Omar E. Pol_, Mar 15 2014