A382721 Number of entries in the n-th row of Pascal's triangle not divisible by 11.
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 6, 12, 18, 24, 30, 36, 42, 48, 54, 60, 66, 7, 14, 21, 28, 35, 42, 49, 56, 63, 70, 77, 8, 16, 24, 32
Offset: 0
Keywords
Links
- Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, Periodic minimum in the count of binomial coefficients not divisible by a prime, arXiv:2408.06817 [math.NT], 2024.
Programs
-
Python
from math import prod from gmpy2 import digits def A382721(n): return prod(int(d,11)+1 for d in digits(n,11)) # Chai Wah Wu, Aug 10 2025