A249434 -id:A249434 - cp's OEIS frontend

A249151 Largest m such that m! divides the product of elements on row n of Pascal's triangle: a(n) = A055881(A001142(n)).

1, 1, 2, 1, 4, 2, 6, 1, 2, 4, 10, 7, 12, 6, 4, 1, 16, 2, 18, 4, 6, 10, 22, 11, 4, 12, 2, 6, 28, 25, 30, 1, 10, 16, 6, 36, 36, 18, 12, 40, 40, 6, 42, 10, 23, 22, 46, 19, 6, 4, 16, 12, 52, 2, 10, 35, 18, 28, 58, 47, 60, 30, 63, 1, 12, 10, 66, 16, 22, 49, 70, 41, 72, 36, 4, 18, 10, 12, 78, 80, 2

Offset: 0

Antti Karttunen, Oct 25 2014

A000225 gives the positions of ones.

A006093 seems to give all such k, that a(k) = k.

			              Binomial coeff.   Their product  Largest k!
                 A007318          A001142(n)   which divides
Row 0                1                    1        1!
Row 1              1   1                  1        1!
Row 2            1   2   1                2        2!
Row 3          1   3   3   1              9        1!
Row 4        1   4   6   4   1           96        4! (96 = 4*24)
Row 5      1   5  10  10   5   1       2500        2! (2500 = 1250*2)
Row 6    1   6  15  20  15   6   1   162000        6! (162000 = 225*720)

Chai Wah Wu, Table of n, a(n) for n = 0..10000 (terms 0..4096 from Antti Karttunen)

One more than A249150.
Cf. A249423 (numbers k such that a(k) = k+1).
Cf. A249429 (numbers k such that a(k) > k).
Cf. A249433 (numbers k such that a(k) < k).
Cf. A249434 (numbers k such that a(k) >= k).
Cf. A249424 (numbers k such that a(k) = (k-1)/2).
Cf. A249428 (and the corresponding values, i.e. numbers n such that A249151(2n+1) = n).
Cf. A249425 (record positions).
Cf. A249427 (record values).
Cf. A001142, A006093, A000225, A007917, A055881, A187059, A249346, A249421, A249430, A249431, A249432.

A249151(n) = { my(uplim,padicvals,b); uplim = (n+3); padicvals = vector(uplim); for(k=0, n, b = binomial(n, k); for(i=1, uplim, padicvals[i] += valuation(b, prime(i)))); k = 1; while(k>0, for(i=1, uplim, if((padicvals[i] -= valuation(k, prime(i))) < 0, return(k-1))); k++); };
\\ Alternative implementation:
A001142(n) = prod(k=1, n, k^((k+k)-1-n));
A055881(n) = { my(i); i=2; while((0 == (n%i)), n = n/i; i++); return(i-1); }
A249151(n) = A055881(A001142(n));
for(n=0, 4096, write("b249151.txt", n, " ", A249151(n)));

from itertools import count
from collections import Counter
from math import comb
from sympy import factorint
def A249151(n):
    p = sum((Counter(factorint(comb(n,i))) for i in range(n+1)),start=Counter())
    for m in count(1):
        f = Counter(factorint(m))
        if not f<=p:
            return m-1
        p -= f # Chai Wah Wu, Aug 19 2025

(define (A249151 n) (A055881 (A001142 n)))

a(n) = A055881(A001142(n)).

A249433 Integers n such that n! does not divide the product of elements on row n of Pascal's triangle.

Original entry on oeis.org

3, 5, 7, 8, 9, 11, 13, 14, 15, 17, 19, 20, 21, 23, 24, 25, 26, 27, 29, 31, 32, 33, 34, 37, 38, 41, 43, 44, 45, 47, 48, 49, 50, 51, 53, 54, 55, 56, 57, 59, 61, 63, 64, 65, 67, 68, 69, 71, 73, 74, 75, 76, 77, 80, 81, 84, 85, 86, 87, 90, 91, 92, 93, 94, 95, 97, 98, 99, 101, 103, 105, 109, 110, 111, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 127, 128

Offset: 1

Antti Karttunen, Nov 02 2014

nonn

Integers n such that A249151(n) < n.

Equally: Integers n such that A249431(n) is negative.

			See the examples at A249434.

Antti Karttunen, Table of n, a(n) for n = 1..2676

Complement: A249434.
Subsequences: A000225, A024023, A024049, etc., (after their two initial terms, i.e. A249435 without its initial zero is also a subsequence), A249424, A249436.
Cf. A000142, A001142, A007318, A249151, A249431.

A249425 Positions of records in A249150 and A249151.

Original entry on oeis.org

0, 2, 4, 6, 10, 12, 16, 18, 22, 28, 30, 35, 39, 42, 46, 52, 58, 60, 62, 66, 70, 72, 78, 79, 82, 83, 88, 89, 96, 100, 102, 104, 106, 107, 112, 125, 126, 130, 131, 136, 138, 143, 148, 149, 153, 156, 159, 162, 164, 166, 167, 172, 174, 179, 181, 190, 192, 194, 196, 197, 199, 207, 209, 219, 222, 226, 228, 232, 238, 240, 250, 256

Offset: 1

Antti Karttunen, Oct 28 2014

nonn

This is not a subsequence of A249434, as k = a(36) = 125 is the first case where A249431(k) < 0 as A249151(125) = 119.

Antti Karttunen, Table of n, a(n) for n = 1..999

Cf. A249150, A249151, A249431, A249434.

A249431 a(n) = A249151(n) - n.

Original entry on oeis.org

1, 0, 0, -2, 0, -3, 0, -6, -6, -5, 0, -4, 0, -7, -10, -14, 0, -15, 0, -15, -14, -11, 0, -12, -20, -13, -24, -21, 0, -4, 0, -30, -22, -17, -28, 1, 0, -19, -26, 1, 0, -35, 0, -33, -21, -23, 0, -28, -42, -45, -34, -39, 0, -51, -44, -20, -38, -29, 0, -12, 0, -31, 1, -62, -52, -55, 0, -51, -46, -20, 0, -30, 0

Offset: 0

Antti Karttunen, Nov 02 2014

It seems that A006093 gives the positions of zeros.

Chai Wah Wu, Table of n, a(n) for n = 0..10000 (terms 0..4096 from Antti Karttunen)

A249433 and A249434 give the positions of negative and nonnegative values, respectively.
A249430 gives the position where +n appears for the first time, A249432 the positions of records of positive values.
Cf. A006093, A249151.

from itertools import count
from collections import Counter
from math import comb
from sympy import factorint
def A249431(n):
    p = sum((Counter(factorint(comb(n,i))) for i in range(n+1)),start=Counter())
    for m in count(1):
        f = Counter(factorint(m))
        if not f<=p:
            return m-1-n
        p -= f # Chai Wah Wu, Aug 19 2025

(definec (A249431 n) (- (A249151 n) n))

a(n) = A249151(n) - n.

A249423 Integers n such that A249150(n) = n; integers n such that A249151(n) = n+1.

Original entry on oeis.org

0, 35, 39, 62, 79, 83, 89, 104, 107, 131, 143, 149, 153, 159, 164, 167, 175, 179, 181, 194, 197, 199, 207, 209, 219, 259, 263, 269, 272, 274, 279, 285, 287, 296, 299, 305, 307, 311, 314, 319, 329, 339, 356, 359, 363, 373, 377, 379, 384, 389, 391, 395, 399, 407, 415, 417, 419, 424, 428, 431, 441, 449, 455, 461, 467, 475, 489, 512

Offset: 1

Antti Karttunen, Oct 28 2014

nonn

Integers n such that {product of elements on row n of Pascal's triangle} is divisible by (n+1)! but not by (n+2)!

Antti Karttunen, Table of n, a(n) for n = 1..732

Subsequence of A249434 and of A249429; it differs from the latter for the first time at n=17, where a(17) = 175 > 174 = A249429(17).

Cf. A000142, A001142, A007318, A249150, A249151, A249424, A249425, A249426.

A249430 a(n) = Least integer k such that A249431(k) = n, and -1 if no such integer exists.

Original entry on oeis.org

1, 0, 350, 439, 174, 713, 323, 1923, 1052, 999, 1766, 3749, 2254, 2253, 1934, 3391, 4184, 4463, 3144, 5451, 9698, 16279, 6398, 5123, 2974, 12863, 19094, 4299, 16574, 5749

Offset: 0

Antti Karttunen, Nov 02 2014

a(n) = the least natural number k such that {product of elements on row k of Pascal's triangle} is divisible by (k+n)! but not by (k+n+1)!

Note: a(18) = 3144 and a(24) = 2974. First values k for which A249431(k) = 16 and 17, if they exist, are larger than 4096.

Nonnegative terms are all members of A249434.

Cf. A000142, A001142, A007318, A249151, A249431, A249432.

from itertools import count
from math import factorial
def A249430(n):
    f = factorial(n)
    g = f*(n+1)
    pascal = [1]
    for k in count(0):
        a = 1
        for i in range(k+1):
            a = a*pascal[i]%f
        if not a:
            b = 1
            for i in range(k+1):
                b = b*pascal[i]%g
            if b:
                return k
        f = g
        g *= k+n+2
        pascal = [1]+[pascal[i]+pascal[i+1] for i in range(k)]+[1] # Chai Wah Wu, Aug 18 2025

(define (A249430 n) (let loop ((k 0)) (cond ((= n (A249431 k)) k) (else (loop (+ 1 k))))))

a(16)-a(20) from Chai Wah Wu, Aug 19 2025

a(21)-a(29) from Chai Wah Wu, Aug 27 2025

A249432 Positions of records in A249431.

Original entry on oeis.org

0, 174, 323, 999, 1766, 1934, 2974, 4299, 5749, 9974, 15685, 25478, 31406

Offset: 1

Antti Karttunen, Nov 02 2014

The corresponding record values in A249431 are: 1, 4, 6, 9, 10, 14, 24, ...

Larger terms could be found by searching large prime gaps: A249431(31406) = 62, and any number k such that A249431(k) >= 63 must have nextprime(k) - k > 63. - Charlie Neder, May 24 2019

Subsequence of A249434 and A249430.

Cf. A249151, A249431, A249430.

from itertools import count, islice
from collections import Counter
from math import comb
from sympy import factorint
def A249432_gen(): # generator of terms
    c = -1
    for n in count(0):
        p = sum((Counter(factorint(comb(n,i))) for i in range(n+1)),start=Counter())
        for m in count(1):
            f = Counter(factorint(m))
            if not f<=p:
                break
            p -= f
        if (k:=m-1-n)>c:
            yield n
            c = k
A249432_list = list(islice(A249432_gen(),4)) # Chai Wah Wu, Aug 19 2025

a(8)-a(13) from Charlie Neder, May 24 2019

A249429 Integers n such that (n+1)! divides the product of elements on row n of Pascal's triangle.

Original entry on oeis.org

0, 35, 39, 62, 79, 83, 89, 104, 107, 131, 143, 149, 153, 159, 164, 167, 174, 175, 179, 181, 194, 197, 199, 207, 209, 219, 259, 263, 269, 272, 274, 279, 285, 287, 296, 299, 305, 307, 311, 314, 319, 323, 329, 339, 350, 356, 359, 363, 373, 377, 379, 384, 389, 391, 395, 398, 399, 407, 415, 417, 419, 424, 428, 431, 439, 440, 441, 449, 454, 455, 461, 467, 475, 489, 512

Offset: 1

Antti Karttunen, Nov 02 2014

nonn

Integers n such that A249151(n) > n.

Antti Karttunen, Table of n, a(n) for n = 1..857

Subsequence of A249434.
Cf. A000142, A001142, A007318, A249151, A249433.
Differs from its subsequence A249423 for the first time at n=17, where a(17) = 174, while A249423(17) = 175.

A249436 Integers n such that n/2 < A249151(n) < n.

Original entry on oeis.org

11, 29, 44, 55, 59, 69, 71, 111, 119, 125, 139, 188, 215, 223, 230, 233, 239, 251, 324, 335, 349, 351, 447, 458, 474, 479, 493, 494, 503, 509, 560, 593, 599, 647, 662, 701, 714, 719, 831, 835, 849, 895, 956, 959, 979, 991, 1000, 1007, 1019, 1034, 1063, 1077, 1169, 1224, 1319, 1322, 1364, 1376, 1424, 1427, 1448, 1507

Offset: 1

Antti Karttunen, Nov 02 2014

Integers n such that A001142(n) [product of elements on row n of Pascal's triangle] is divisible by floor[(n+1)/2]! but not by n!

These are the abscissas of "stray points" in the sparsely populated region between the two topmost rays visible in the scatter plot of A249151 which have slopes 1 and 1/2: A249434 (A006093) and A249424.

Chai Wah Wu, Table of n, a(n) for n = 1..200 (terms 1..115 from Antti Karttunen)

A249437 gives the corresponding values at those points.
Subsequence of A249433.
Cf. A000142, A001142, A249151, A006093, A249424, A249434.

A249437 a(n) = A249151(A249436(n)).

Original entry on oeis.org

7, 25, 23, 35, 47, 49, 41, 67, 89, 119, 97, 139, 113, 131, 120, 188, 181, 233, 168, 265, 209, 241, 259, 329, 309, 357, 337, 449, 463, 501, 288, 461, 409, 329, 493, 548, 571, 656, 649, 681, 577, 515, 791, 709, 601, 837, 805, 919, 995, 528, 721, 901, 961, 1009, 1121, 895, 1273, 977, 1063, 1121, 1376, 1273, 1057, 840, 1189, 1009

Offset: 1

Antti Karttunen, Nov 02 2014

nonn

These are the ordinates of "stray points", listed in the order they appear (from left to right) in the scatter plot of A249151, in the sparsely populated region between the two topmost rays which have slopes 1 and 1/2: A249434 (A006093) and A249424.

Antti Karttunen, Table of n, a(n) for n = 1..115

A249438 gives the same sequence sorted into ascending order.

Cf. A249436, A249151, A006093, A249424, A249434.

(define (A249437 n) (A249151 (A249436 n)))

a(n) = A249151(A249436(n)).

cp's OEIS Frontend

A249151 Largest m such that m! divides the product of elements on row n of Pascal's triangle: a(n) = A055881(A001142(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Python

Scheme

Formula

A249433 Integers n such that n! does not divide the product of elements on row n of Pascal's triangle.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A249425 Positions of records in A249150 and A249151.

Views

Author

Keywords

Comments

Links

Crossrefs

A249431 a(n) = A249151(n) - n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Python

Scheme

Formula

A249423 Integers n such that A249150(n) = n; integers n such that A249151(n) = n+1.

Views

Author

Keywords

Comments

Links

Crossrefs

A249430 a(n) = Least integer k such that A249431(k) = n, and -1 if no such integer exists.

Views

Author

Keywords

Comments

Crossrefs

Programs

Python

Scheme

Extensions

A249432 Positions of records in A249431.

Views

Author

Keywords

Comments

Crossrefs

Programs

Python

Extensions

A249429 Integers n such that (n+1)! divides the product of elements on row n of Pascal's triangle.

Views

Author

Keywords

Comments

Links

Crossrefs

A249436 Integers n such that n/2 < A249151(n) < n.

Views

Author

Keywords

Comments

Links

Crossrefs