|
Search: id:A134363
|
|
|
| A134363 |
|
Irregular array where n-th row (of A061395(n) terms, for n>=2) is such that n = product{k=1 to A061395(n)} p(k)^(sum{j=1 to k} a(n,j)) (where a(n,j) is the j-th term of the n-th row of the array, and p(k) is the k-th prime). Row 1 is {0}. |
|
+0
2
|
|
| 0, 1, 0, 1, 2, 0, 0, 1, 1, 0, 0, 0, 0, 1, 3, 0, 2, 1, -1, 1, 0, 0, 0, 0, 1, 2, -1, 0, 0, 0, 0, 0, 1, 1, -1, 0, 1, 0, 1, 0, 4, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 2, -2, 1, 0, 1, -1, 1, 1, -1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 3, -2, 0, 0, 2
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
The rows of this array also give all the ordered ways that a finite number of integers can be arranged so that their partial sums, from left to right, are all nonnegative, and their total sum is positive.
|
|
EXAMPLE
|
Row 20 is (2,-2,1). So 20 is p(1)^a(20,1) * p(2)*(a(20,1)+a(20,2)) * p(3)^(a(20,1)+a(20,2)+a(20,3)) = 2^2 * 3^(2-2) * 5^(2-2+1) = 2^2 *3^0 *5^1.
|
|
CROSSREFS
|
Cf. A061395, A067255, A134364.
Sequence in context: A109502 A112983 A112609 this_sequence A054015 A056137 A139354
Adjacent sequences: A134360 A134361 A134362 this_sequence A134364 A134365 A134366
|
|
KEYWORD
|
tabl,sign
|
|
AUTHOR
|
Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Oct 22 2007
|
|
|
Search completed in 0.002 seconds
|
