|
Search: id:A096133
|
|
|
| A096133 |
|
Triangle T(j,k) = (j^k) mod (j*k) for 1 <= k <= j, read by rows. |
|
+0 2
|
|
| 0, 0, 0, 0, 3, 0, 0, 0, 4, 0, 0, 5, 5, 5, 0, 0, 0, 0, 0, 6, 0, 0, 7, 7, 21, 7, 7, 0, 0, 0, 8, 0, 8, 16, 8, 0, 0, 9, 0, 9, 9, 27, 9, 9, 0, 0, 0, 10, 0, 0, 40, 10, 0, 10, 0, 0, 11, 11, 33, 11, 55, 11, 33, 44, 11, 0, 0, 0, 0, 0, 12, 0, 12, 0, 0, 24, 12, 0, 0, 13, 13, 13, 13, 13, 13, 65, 91, 39, 13, 13
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
EXAMPLE
|
0
0 0
0 3 0
0 0 4 0
0 5 5 5 0
0 0 0 0 6 0
0 7 7 21 7 7 0
|
|
PROGRAM
|
(PARI) for(j=1, 13, for(k=1, j, print1((j^k)%(j*k), ", ")))
|
|
CROSSREFS
|
Row sums are in A157351. [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 30 2009]
Sequence in context: A007514 A151671 A122480 this_sequence A118112 A081805 A084681
Adjacent sequences: A096130 A096131 A096132 this_sequence A096134 A096135 A096136
|
|
KEYWORD
|
nonn,easy,tabl
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 04 2004
|
|
EXTENSIONS
|
Edited and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jul 16 2004
|
|
|
Search completed in 0.002 seconds
|