cp's OEIS Frontend

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.

A273261 Irregular triangle read by rows: T(n,k) = sum of the elements of the k-th row of the difference table of the divisors of n.

This page as a plain text file.
%I A273261 #35 Apr 02 2017 03:21:17
%S A273261 1,3,1,4,2,7,3,1,6,4,12,5,2,2,8,6,15,7,3,1,13,8,4,18,9,4,0,12,10,28,
%T A273261 11,5,4,3,1,14,12,24,13,6,-2,24,14,8,8,31,15,7,3,1,18,16,39,17,8,6,4,
%U A273261 12,20,18,42,19,9,4,3,-11,32,20,12,8,36,21,10,-6,24,22,60,23,11,8,6,3,4,-12,31,24,16,42,25,12,-8
%N A273261 Irregular triangle read by rows: T(n,k) = sum of the elements of the k-th row of the difference table of the divisors of n.
%C A273261 Row 2^k gives the first k+1 positive terms of A000225 in decreasing order, k >= 0.
%C A273261 If n is prime then row n contains only two terms: n+1 and n-1.
%C A273261 First differs from A274531 at a(41).
%C A273261 For n = p^k, T(n, 1) = n - 1, T(n, n) = (p - 1)^k. a(A006218(n - 1) + 1) = T(n, 0), a(A006218(n)) = T(n, t-1) where t is the number of divisors of n. - _David A. Corneth_, Jun 18 2016
%C A273261 Let D_n(m, c) be the k-th element in row m. The divisors of n are in row m = 0. Let t be the number of divisors of n. Then T(n, k) = D_n(k - 1, t-1) - D_n(k - 1, 0). - _David A. Corneth_, Jun 25 2016
%C A273261 For n in A187204, the last term of the n-th row is 0. - _Michel Marcus_, Apr 02 2017
%e A273261 Triangle begins:
%e A273261 1;
%e A273261 3, 1;
%e A273261 4, 2;
%e A273261 7, 3, 1;
%e A273261 6, 4;
%e A273261 12, 5, 2, 2;
%e A273261 8, 6;
%e A273261 15, 7, 3, 1;
%e A273261 13, 8, 4;
%e A273261 18, 9, 4, 0;
%e A273261 12, 10;
%e A273261 28, 11, 5, 4, 3, 1;
%e A273261 14, 12;
%e A273261 24, 13, 6, -2;
%e A273261 24, 14, 8, 8;
%e A273261 31, 15, 7, 3, 1;
%e A273261 18, 16;
%e A273261 39, 17, 8, 6, 4, 12;
%e A273261 20, 18;
%e A273261 42, 19, 9, 4, 3, -11;
%e A273261 32, 20, 12, 8;
%e A273261 36, 21, 10, -6;
%e A273261 24, 22;
%e A273261 60, 23, 11, 8, 6, 3, 4, -12;
%e A273261 31, 24, 16;
%e A273261 42, 25, 12, -8;
%e A273261 ...
%e A273261 For n = 14 the divisors of 14 are 1, 2, 7, 14, and the difference triangle of the divisors is
%e A273261 1, 2, 7, 14;
%e A273261 1, 5, 7;
%e A273261 4, 2;
%e A273261 -2;
%e A273261 The row sums give [24, 13, 6, -2] which is also the 14th row of the irregular triangle.
%e A273261 In the first row, the last element is 14, the first is 1. So the sum of the second row is 14 - 1 is 13. Similarly, the sum of the third row is 7 - 1 = 6, and of the last row, 2 - 4 = -2. - _David A. Corneth_, Jun 25 2016
%t A273261 Map[Total, Table[NestWhileList[Differences, Divisors@ n, Length@ # > 1 &], {n, 26}], {2}] // Flatten (* _Michael De Vlieger_, Jun 26 2016 *)
%o A273261 (PARI) row(n) = {my(d = divisors(n));my(nd = #d); my(m = matrix(#d, #d)); for (j=1, nd, m[1,j] = d[j];); for (i=2, nd, for (j=1, nd - i +1, m[i,j] = m[i-1,j+1] - m[i-1,j];);); vector(nd, i, sum(j=1, nd, m[i, j]));}
%o A273261 tabf(nn) = for (n=1, nn, print(row(n)););
%o A273261 lista(nn) = for (n=1, nn, v = row(n); for (j=1, #v, print1(v[j], ", "));); \\ _Michel Marcus_, Jun 25 2016
%Y A273261 Row lengths give A000005. Column 1 is A000203.
%Y A273261 Right border gives A187202. Row sums give A273103.
%Y A273261 Cf. A000225, A006218, A187204, A273102, A273262, A273263, A274531.
%K A273261 sign,tabf
%O A273261 1,2
%A A273261 _Omar E. Pol_, May 20 2016