|
Search: id:A073466
|
|
|
| A073466 |
|
Triangle T(j,k) = remainder when j-th triangular number is divided by k-th triangular number, for 2 < j and 1 < k < j. |
|
+0
1
|
|
| 0, 1, 4, 0, 3, 5, 0, 3, 1, 6, 1, 4, 8, 13, 7, 0, 0, 6, 6, 15, 8, 0, 3, 5, 0, 3, 17, 9, 1, 1, 5, 10, 13, 27, 19, 10, 0, 0, 6, 6, 3, 10, 30, 21, 11, 0, 0, 8, 3, 15, 22, 6, 33, 23, 12, 1, 1, 1, 1, 7, 7, 19, 1, 36, 25, 13, 0, 3, 5, 0, 0, 21, 33, 15, 50, 39, 27, 14, 0, 0, 0, 0, 15, 8, 12, 30, 10
(list; table; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
For triangular numbers see A000217. The zero values T(j,1) have been omitted, so the first row consists of T(3,2). A072524(n) = sum(T(n,k), k = 2, ..., n-1) for n > 2.
|
|
EXAMPLE
|
a(0) = triangular(3) mod triangular(2) = 6 mod 3 = 0; a(2) = triangular(4) mod triangular(3) = 10 mod 6 = 4.
|
|
PROGRAM
|
(PARI) for(j=3, 15, for(k=2, j-1, print1(binomial(j+1, 2)%binomial(k+1, 2), ", ")))
|
|
CROSSREFS
|
Cf. A000217, A072524.
Adjacent sequences: A073463 A073464 A073465 this_sequence A073467 A073468 A073469
Sequence in context: A106142 A092512 A060568 this_sequence A062525 A085655 A048649
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Aug 02 2002
|
|
|
Search completed in 0.002 seconds
|
