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!)
A108498 Triangle read by rows: T(n,k) = sum_i{1<=i<=n} k^i mod n, showing 1<=k<=n. 3

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

%S 0,0,0,0,2,0,0,2,0,0,0,2,3,4,0,0,0,0,0,0,0,0,2,3,4,5,6,0,0,6,0,4,0,2,

%T 0,0,0,5,3,0,2,6,0,8,0,0,6,2,0,0,0,6,2,0,0,0,2,3,4,5,6,7,8,9,10,0,0,6,

%U 0,0,0,6,0,0,0,6,0,0,0,2,3,4,5,6,7,8,9,10,11,12,0,0,6,12,6,2,0,0,0,6,12,6,2

%N Triangle read by rows: T(n,k) = sum_i{1<=i<=n} k^i 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. T(p, k)=k for p prime and 1<k<p.

%e Rows start: 0; 0,0; 0,2,0; 0,2,0,0; 0,2,3,4,0; 0,0,0,0,0,0; 0,2,3,4,5,6,0; etc.

%e T(7,3) = 3+9+27+81+243+729+2187 mod 7 = 3279 mod 7 = 3.

%Y Cf. A014117, A059721, A108048, A108497, 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 August 1 06:36 EDT 2024. Contains 374810 sequences. (Running on oeis4.)