cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-13 of 13 results.

A249732 Number of (not necessarily distinct) multiples of 4 on row n of Pascal's triangle.

Original entry on oeis.org

0, 0, 0, 0, 2, 0, 1, 0, 6, 4, 3, 0, 7, 2, 3, 0, 14, 12, 11, 8, 13, 6, 7, 0, 19, 14, 11, 4, 17, 6, 7, 0, 30, 28, 27, 24, 29, 22, 23, 16, 33, 26, 23, 12, 29, 14, 15, 0, 43, 38, 35, 28, 37, 22, 23, 8, 45, 34, 27, 12, 37, 14, 15, 0, 62, 60, 59, 56, 61, 54, 55, 48, 65, 58, 55, 44, 61, 46, 47, 32
Offset: 0

Views

Author

Antti Karttunen, Nov 04 2014

Keywords

Comments

a(n) = Number of zeros on row n of A034931 (Pascal's triangle reduced modulo 4).
This should have a formula (see A048967).

Examples

			Row 9 of Pascal's triangle is: {1,9,36,84,126,126,84,36,9,1}. The terms 36 and 84 are only multiples of four, and both of them occur two times on that row, thus a(9) = 2*2 = 4.
Row 10 of Pascal's triangle is: {1,10,45,120,210,252,210,120,45,10,1}. The terms 120 (= 4*30) and 252 (= 4*63) are only multiples of four, and the former occurs twice, while the latter is alone at the center, thus a(10) = 2+1 = 3.
		

Crossrefs

Programs

  • PARI
    A249732(n) = { my(c=0); for(k=0,n\2,if(!(binomial(n,k)%4),c += (if(k<(n/2),2,1)))); return(c); } \\ Slow...
    for(n=0, 8192, write("b249732.txt", n, " ", A249732(n)));
    
  • Python
    def A249732(n): return n+1-(2+((n>>1)&~n).bit_count()<>1) # Chai Wah Wu, Jul 24 2025

Formula

Other identities:
a(n) <= A048277(n) for all n.
a(n) <= A048967(n) for all n.

A249346 The exponent of the highest power of 6 dividing the product of the elements on the n-th row of Pascal's triangle.

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 4, 0, 0, 10, 10, 4, 13, 8, 3, 0, 6, 0, 28, 20, 12, 24, 15, 6, 20, 10, 0, 16, 47, 22, 26, 0, 30, 48, 33, 18, 73, 56, 39, 40, 42, 24, 47, 28, 9, 54, 57, 16, 62, 40, 18, 46, 23, 0, 82, 32, 84, 94, 87, 44, 92, 52, 36, 0, 102, 72, 107, 76, 45, 82, 50, 18, 128, 94, 60, 100, 65, 30, 72, 36, 0
Offset: 0

Views

Author

Antti Karttunen, Oct 31 2014

Keywords

Comments

Sounds good with MIDI player set to FX-7.

Crossrefs

Minimum of terms A187059(n) and A249343(n).

Programs

  • Haskell
    a249346 = a122841 . a001142  -- Reinhard Zumkeller, Mar 16 2015
  • Mathematica
    IntegerExponent[#,6]&/@Times@@@Table[Binomial[n,k],{n,0,80},{k,0,n}] (* Harvey P. Dale, Nov 21 2023 *)
  • PARI
    A249346(n) = { my(b, s2, s3); s2 = 0; s3 = 0; for(k=0, n, b = binomial(n, k); s2 += valuation(b, 2); s3 += valuation(b, 3)); min(s2,s3); };
    for(n=0, 7775, write("b249346.txt", n, " ", A249346(n)));
    
  • Scheme
    (define (A249346 n) (min (A187059 n) (A249343 n)))
    
  • Scheme
    (define (A249346 n) (A122841 (A001142 n)))
    

Formula

a(n) = min(A187059(n), A249343(n)).
a(n) = A122841(A001142(n)).
Other identities:
a(n) = 0 when A249151(n) < 3.

A249154 (n+1) times the number of 1's in the binary expansion of n.

Original entry on oeis.org

0, 2, 3, 8, 5, 12, 14, 24, 9, 20, 22, 36, 26, 42, 45, 64, 17, 36, 38, 60, 42, 66, 69, 96, 50, 78, 81, 112, 87, 120, 124, 160, 33, 68, 70, 108, 74, 114, 117, 160, 82, 126, 129, 176, 135, 184, 188, 240, 98, 150, 153, 208, 159, 216, 220, 280, 171, 232, 236, 300, 244, 310, 315, 384, 65
Offset: 0

Views

Author

Antti Karttunen, Nov 02 2014

Keywords

Crossrefs

Programs

Formula

a(n) = (n+1) * A000120(n).
a(n) = A000120(n) + A245788(n).
a(n) = 2*A000788(n) - A187059(n).
Previous Showing 11-13 of 13 results.