cp's OEIS Frontend

A242849 Triangle read by rows: T(n,k) = A060828(n)/(A060828(k) * A060828(n-k)).

%I A242849 #22 Mar 04 2023 04:27:26
%S A242849 1,1,1,1,1,1,1,3,3,1,1,1,3,1,1,1,1,1,1,1,1,1,3,3,1,3,3,1,1,1,3,1,1,3,
%T A242849 1,1,1,1,1,1,1,1,1,1,1,1,9,9,3,9,9,3,9,9,1,1,1,9,3,3,9,3,3,9,1,1,1,1,
%U A242849 1,3,3,3,3,3,3,1,1,1,1,3,3,1,9,9,3,9,9,1
%N A242849 Triangle read by rows: T(n,k) = A060828(n)/(A060828(k) * A060828(n-k)).
%C A242849 This triangle can be obtained by replacing each entry of Pascal's Triangle by the largest power of 3 dividing that entry.
%C A242849 The exponent of T(n,k) is the number of 'carries' that occur when adding k and n-k in base 3 using the traditional addition algorithm.
%C A242849 If T(n,k) != 0 mod 3, then n dominates k in base 3.
%H A242849 Tyler Ball, Tom Edgar, and Daniel Juda, <a href="http://dx.doi.org/10.4169/math.mag.87.2.135">Dominance Orders, Generalized Binomial Coefficients, and Kummer's Theorem</a>, Mathematics Magazine, Vol. 87, No. 2, April 2014, pp. 135-143.
%H A242849 Tyler Ball and Daniel Juda, <a href="https://scholar.rose-hulman.edu/rhumj/vol14/iss2/2">Dominance over N</a>, Rose-Hulman Undergraduate Mathematics Journal, Vol. 13, No. 2, Fall 2013.
%H A242849 E. Burlachenko, <a href="https://arxiv.org/abs/1612.00970">Fractal generalized Pascal matrices</a>, arXiv:1612.00970 [math.NT], 2016. See p. 7.
%H A242849 Tom Edgar and Michael Z. Spivey, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL19/Edgar/edgar3.html">Multiplicative functions, generalized binomial coefficients, and generalized Catalan numbers</a>, Journal of Integer Sequences, Vol. 19 (2016), Article 16.1.6.
%F A242849 T(n,k) = A060828(n)/(A060828(k) * A060828(n-k)).
%F A242849 T(n,k) = Product_{i=1..n} A038500(i)/(Product_{i=1..k} A038500(i)*Product_{i=1..n-k} A038500(i)).
%F A242849 T(n,k) = A038500(n)/n*(k/A038500(k)*T(n-1,k-1)+(n-k)/A038500(n-k)*T(n-1,k)).
%e A242849 The triangle begins
%e A242849 1
%e A242849 1 1
%e A242849 1 1 1
%e A242849 1 3 3 1
%e A242849 1 1 3 1 1
%e A242849 1 1 1 1 1 1
%e A242849 1 3 3 1 3 3 1.
%t A242849 s3[n_] := 3^IntegerExponent[n!, 3];
%t A242849 T[n_, k_] := s3[n]/(s3[k] s3[n-k]);
%t A242849 Table[T[n, k], {n, 0, 12}, {k, 0, n}] // Flatten (* _Jean-François Alcover_, Dec 06 2018 *)
%o A242849 (Sage)
%o A242849 m=50
%o A242849 T=[0]+[3^valuation(i,3) for i in [1..m]]
%o A242849 Table=[[prod(T[1:i+1])/(prod(T[1:j+1])*prod(T[1:i-j+1])) for j in [0..i]] for i in [0..m-1]]
%o A242849 [x for sublist in Table for x in sublist]
%Y A242849 Cf. A007318, A038500, A060828, A082907.
%K A242849 nonn,tabl
%O A242849 0,8
%A A242849 _Tom Edgar_, May 23 2014