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
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, 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, 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 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
FORMULA
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.
EXAMPLE
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.
T(7,3) = 3^(7+1)-3 mod 7 = 6558 mod 7 = 6.
CROSSREFS
Sequence in context: A112301 A136521 A066448 * A108498 A178923 A242609
KEYWORD
nonn,tabl
AUTHOR
Henry Bottomley, Jun 06 2005
STATUS
approved

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 July 8 11:13 EDT 2024. Contains 374155 sequences. (Running on oeis4.)