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 A127477 #4 Mar 30 2012 17:39:18 %S A127477 1,2,1,5,0,2,6,3,0,2,17,0,0,0,4,10,5,4,0,0,2,37,0,0,0,0,0,6,22,11,0,6, %T A127477 0,0,0,4,41,0,14,0,0,0,0,0,6,34,17,0,0,8,0,0,0,0,4,101,0,0,0,0,0,0,0, %U A127477 0,0,10,30,15,12,10,0,6,0,0,0,0,0,4,145,0,0,0,0,0,0,0,0,0,0,0,12,74,37,0 %N A127477 Triangle T(n,k) read by rows: matrix product A054522 * A054523. %C A127477 If the two matrices A054522 and A054523 are commuted, the matrix product becomes A127478. %F A127477 T(n,k) = sum_{j=k..n} A054522(n,j) * A054523(j,k). %F A127477 sum_{k=1..n} T(n,k) = A057660(n) (row sums). %F A127477 T(n,n) = A000010(n) (diagonal). %F A127477 T(n,1) = A029939(n). %e A127477 First few rows of the triangle are: %e A127477 1; %e A127477 2, 1; %e A127477 5, 0, 2; %e A127477 6, 3, 0, 2; %e A127477 17, 0, 0, 0, 4; %e A127477 10, 5, 4, 0, 0, 2; %e A127477 37, 0, 0, 0, 0, 0, 6; %e A127477 22, 11, 0, 6, 0, 0, 0, 4; %p A127477 A054522 := proc(n,k) if k = 1 then 1; elif n mod k = 0 then numtheory[phi](k) ; else 0 ; fi; end: %p A127477 A054523 := proc(n,k) if k = n then 1; elif n mod k = 0 then numtheory[phi](n/k) ; else 0 ; fi; end: %p A127477 A127477 := proc(n,k) add( A054522(n,j)*A054523(j,k), j=k..n) ; end: seq(seq( A127477(n,k),k=1..n),n=1..15) ; %Y A127477 Cf. A054522, A054523, A057660, A000010, A029939. %K A127477 nonn,tabl,easy %O A127477 1,2 %A A127477 _Gary W. Adamson_, Jan 15 2007 %E A127477 Converted comments to formulas, extended - _R. J. Mathar_, Sep 11 2009