login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108497 Triangle read by rows: T(n,k) = k^(n+1)-k mod n, showing 1<=k<=n. 5

%I #3 Mar 30 2012 18:51:39

%S 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 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 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 Triangle read by rows: T(n,k) = k^(n+1)-k mod n, showing 1<=k<=n.

%F 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 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 T(7,3) = 3^(7+1)-3 mod 7 = 6558 mod 7 = 6.

%Y Cf. A014117, A108495, A108496, A108498, A108499.

%K nonn,tabl

%O 1,5

%A _Henry Bottomley_, Jun 06 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 7 11:06 EDT 2024. Contains 375730 sequences. (Running on oeis4.)