login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A249347 The exponent of the highest power of 7 dividing the product of the elements on the n-th row of Pascal's triangle. 6

%I #15 Jul 22 2022 10:33:54

%S 0,0,0,0,0,0,0,6,5,4,3,2,1,0,12,10,8,6,4,2,0,18,15,12,9,6,3,0,24,20,

%T 16,12,8,4,0,30,25,20,15,10,5,0,36,30,24,18,12,6,0,90,82,74,66,58,50,

%U 42,89,80,71,62,53,44,35,88,78,68,58,48,38,28,87,76,65,54,43,32,21,86,74,62,50,38,26,14,85,72,59,46,33,20,7,84,70,56,42,28,14,0

%N The exponent of the highest power of 7 dividing the product of the elements on the n-th row of Pascal's triangle.

%H Antti Karttunen, <a href="/A249347/b249347.txt">Table of n, a(n) for n = 0..2400</a>

%H Jeffrey C. Lagarias and Harsh Mehta, <a href="http://arxiv.org/abs/1409.4145">Products of binomial coefficients and unreduced Farey fractions</a>, arXiv:1409.4145 [math.NT], 2014.

%F a(n) = A214411(A001142(n)).

%F a(n) = Sum_{k=0..n} A214411(binomial(n,k)).

%F a(n) = Sum_{i=1..n} (2*i-n-1)*v_7(i), where v_7(i) = A214411(i) is the exponent of the highest power of 7 dividing i. - _Ridouane Oudra_, Jun 03 2022

%o (PARI)

%o allocatemem(234567890);

%o A249347(n) = sum(k=0, n, valuation(binomial(n, k), 7));

%o for(n=0, 2400, write("b249347.txt", n, " ", A249347(n)));

%o (Scheme, two alternative implementations)

%o (define (A249347 n) (A214411 (A001142 n)))

%o (define (A249347 n) (add (lambda (n) (A214411 (A007318 n))) (A000217 n) (A000096 n)))

%o (define (add intfun lowlim uplim) (let sumloop ((i lowlim) (res 0)) (cond ((> i uplim) res) (else (sumloop (+ 1 i) (+ res (intfun i)))))))

%Y Row 4 of array A249421.

%Y Cf. A001142, A007318, A214411, A187059, A249343, A249345.

%K nonn

%O 0,8

%A _Antti Karttunen_, Oct 28 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 03:51 EDT 2024. Contains 371264 sequences. (Running on oeis4.)