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.

A108497 Triangle read by rows: T(n,k) = k^(n+1)-k mod n, showing 1<=k<=n.

This page as a plain text file.
%I A108497 #3 Mar 30 2012 18:51:39
%S A108497 0,0,0,0,2,0,0,2,0,0,0,2,1,2,0,0,0,0,0,0,0,0,2,6,5,6,2,0,0,6,0,4,0,2,
%T A108497 0,0,0,5,6,0,8,3,0,2,0,0,6,4,0,0,0,6,4,0,0,0,2,6,1,9,8,9,1,6,2,0,0,6,
%U A108497 0,0,0,6,0,0,0,6,0,0,0,2,6,12,7,4,3,4,7,12,6,2,0,0,6,10,4,8,0,0,0,6,10,4,8
%N A108497 Triangle read by rows: T(n,k) = k^(n+1)-k mod n, showing 1<=k<=n.
%F A108497 T(n, k+n)=T(n, k). T(n, 0)=T(n, 1)=T(n, n)=T(1, k)=T(2, k)=T(6, k)=T(42, k)=T(1806, k)=0.
%e A108497 Rows start: 0; 0,0; 0,2,0; 0,2,0,0; 0,2,1,2,0; 0,0,0,0,0,0; 0,2,6,5,6,2,0; etc.
%e A108497 T(7,3) = 3^(7+1)-3 mod 7 = 6558 mod 7 = 6.
%Y A108497 Cf. A014117, A108495, A108496, A108498, A108499.
%K A108497 nonn,tabl
%O A108497 1,5
%A A108497 _Henry Bottomley_, Jun 06 2005