The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A114448 Array a(n,k) = n^k (mod k) read by antidiagonals (k>=1, n>=1). 0
 0, 0, 1, 0, 0, 1, 0, 1, 2, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 2, 1, 0, 0, 2, 0, 3, 4, 1, 0, 1, 0, 1, 4, 3, 2, 1, 0, 0, 1, 0, 0, 4, 3, 0, 1, 0, 1, 2, 1, 1, 1, 4, 1, 8, 1, 0, 0, 0, 0, 2, 0, 5, 0, 0, 4, 1, 0, 1, 1, 1, 3, 1, 6, 1, 1, 9, 2, 1, 0, 0, 2, 0, 4, 4, 0, 0, 8, 6, 3, 4, 1, 0, 1, 0, 1, 0, 3, 1, 1, 0, 5, 4, 9, 2, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 COMMENTS Alternate description: triangular array a(n, k) = n^k (mod k) read by rows (n > 1, 0 < k < n). This is equivalent because a(n, k) = a(n-k, k). - David Wasserman, Jan 25 2007 LINKS EXAMPLE 2^6 = 64 and 64 (mod 6) is 4. So a(2,6) = 4. MATHEMATICA a[n_, k_] := Mod[n^k, k]; Table[a[n - k + 1, k], {n, 1, 14}, {k, 1, n}] // Flatten (* Jean-François Alcover, Dec 12 2012 *) CROSSREFS Cf. A051127, A051128, A094263. Transpose of A060154. First 13 rows are A057427(n-1), A015910, A066601, A066602, A066603, A066604, A066438, A066439, A066440, A056969, A066441, A066442, A116609. First 12 columns are A000004, A000035, A010872, A000035, A010874, A070431, A010876, A000035, A021559(n+1), A008959, A010880, A070435. Sequence in context: A098082 A321921 A236419 * A068933 A015472 A049816 Adjacent sequences:  A114445 A114446 A114447 * A114449 A114450 A114451 KEYWORD easy,nonn,tabl AUTHOR Leroy Quet, Feb 14 2006 EXTENSIONS More terms from David Wasserman, Jan 25 2007 STATUS approved

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

Last modified July 26 22:10 EDT 2021. Contains 346300 sequences. (Running on oeis4.)