Divisibility Properties of Integer Sequences

MaRDI QIDQ6425436zbMATH OpenFDO

Authors Daniel B. Shapiro

Publication date 4 February 2023

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Binomial coefficients; factorials; (q)-identities (11B65) Special sequences and polynomials (11B83)

Abstract: A sequence of nonzero integers $f=(f_1,f_2,dots)$ is ``binomid if every $f$-binomid coefficient $$ is an integer. Those terms are the generalized binomial coefficients: [ left[! �egin{array}{c} n \ k end{array}! ight]_f = frac{ f_nf_{n-1}cdots f_{n-k+1} }{ f_kf_{k-1}cdots f_1 }. ] Let $Delta(f)$ be the infinite triangle with those numbers as entries. When $I=(1,2,3,dots)$ then $Delta(I)$ is Pascal's Triangle so that $I$ is binomid. Surprisingly, every row and column of Pascal's Triangle is also binomid. For any $f$, each row and column of $Delta(f)$ generates its own triangle and all those triangles fit together to form the ``Binomid Pyramid $mathbbBP(f)$. Sequence $f$ is ``binomid at every level if all entries of $mathbbBP(f)$ are integers. We prove that several familiar sequences have that property, including the Lucas sequences. In particular, $I=(1,2,3,dots)$, the sequence of Fibonacci numbers, and $(2^n-1{)}_{nge1}$ are binomid at every level.

Recommendations

• scientific article; zbMATH DE number 1408129
• scientific article; zbMATH DE number 17599
• Mean divisibility of multinomial coefficients
• scientific article; zbMATH DE number 611002
• More divisibility properties for binomial coefficients

Cited in

(1)

• Lexicographically minimal extension of a finite binomid index

This page was built for publication: Divisibility Properties of Integer Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6425436)