This site is supported by donations to The OEIS Foundation.
The (a(n),b(n))-Pascal triangle, or (an,bn)-Pascal triangle, is a generalization of the (a,b)-Pascal triangle where an ≡ a(n) and bn ≡ b(n) are integer sequences, keeping the original Pascal triangle recurrence rule unchanged for the interior cells of the triangle.
The (an,bn)-Pascal triangle recursion rule is:
3 ⋅ 5 ⋅ 7 ⋅ {\displaystyle \scriptstyle 3\cdot 5\cdot 7\cdot \,} 13 {\displaystyle \scriptstyle 13\,}
3 2 ⋅ 5 2 ⋅ 7 ⋅ {\displaystyle \scriptstyle 3^{2}\cdot 5^{2}\cdot 7\cdot \,} 11 {\displaystyle \scriptstyle 11\,}
3 ⋅ 5 ⋅ 11 ⋅ {\displaystyle \scriptstyle 3\cdot 5\cdot 11\cdot \,} 17 {\displaystyle \scriptstyle 17\,}
3 ⋅ 5 ⋅ 7 ⋅ {\displaystyle \scriptstyle 3\cdot 5\cdot 7\cdot \,} 13 ⋅ 19 {\displaystyle \scriptstyle 13\cdot 19\,}
3 3 ⋅ 5 3 ⋅ 7 2 ⋅ {\displaystyle \scriptstyle 3^{3}\cdot 5^{3}\cdot 7^{2}\cdot \,} 11 ⋅ 13 {\displaystyle \scriptstyle 11\cdot 13\,}
11 2 ⋅ 17 {\displaystyle \scriptstyle 11^{2}\cdot 17\,}
17 ⋅ 23 {\displaystyle \scriptstyle 17\cdot 23\,}
3 ⋅ 5 ⋅ 7 ⋅ {\displaystyle \scriptstyle 3\cdot 5\cdot 7\cdot \,} 13 ⋅ 19 ⋅ 29 {\displaystyle \scriptstyle 13\cdot 19\cdot 29\,}
3 ⋅ 5 ⋅ 7 ⋅ {\displaystyle \scriptstyle 3\cdot 5\cdot 7\cdot \,} 13 ⋅ 19 ⋅ 29 ⋅ {\displaystyle \scriptstyle 13\cdot 19\cdot 29\cdot \,} 37 {\displaystyle \scriptstyle 37\,}
3 ⋅ 5 ⋅ 7 ⋅ {\displaystyle \scriptstyle 3\cdot 5\cdot 7\cdot \,} 13 ⋅ 19 ⋅ 29 ⋅ {\displaystyle \scriptstyle 13\cdot 19\cdot 29\cdot \,} 37 ⋅ 43 {\displaystyle \scriptstyle 37\cdot 43\,}
3 ⋅ 5 ⋅ 7 ⋅ {\displaystyle \scriptstyle 3\cdot 5\cdot 7\cdot \,} 13 ⋅ 19 ⋅ 29 ⋅ {\displaystyle \scriptstyle 13\cdot 19\cdot 29\cdot \,} 37 ⋅ 43 ⋅ 53 {\displaystyle \scriptstyle 37\cdot 43\cdot 53\,}
3 ⋅ 5 ⋅ 7 ⋅ {\displaystyle \scriptstyle 3\cdot 5\cdot 7\cdot \,} 13 ⋅ 19 ⋅ 29 ⋅ {\displaystyle \scriptstyle 13\cdot 19\cdot 29\cdot \,} 37 ⋅ 43 ⋅ 53 ⋅ {\displaystyle \scriptstyle 37\cdot 43\cdot 53\cdot \,} 61 {\displaystyle \scriptstyle 61\,}
3 ⋅ 5 ⋅ 7 ⋅ {\displaystyle \scriptstyle 3\cdot 5\cdot 7\cdot \,} 13 ⋅ 19 ⋅ 29 ⋅ {\displaystyle \scriptstyle 13\cdot 19\cdot 29\cdot \,} 37 ⋅ 43 ⋅ 53 ⋅ {\displaystyle \scriptstyle 37\cdot 43\cdot 53\cdot \,} 61 ⋅ 71 {\displaystyle \scriptstyle 61\cdot 71\,}
3 ⋅ 5 ⋅ 7 ⋅ {\displaystyle \scriptstyle 3\cdot 5\cdot 7\cdot \,} 13 ⋅ 19 ⋅ 29 ⋅ {\displaystyle \scriptstyle 13\cdot 19\cdot 29\cdot \,} 37 ⋅ 43 ⋅ 53 ⋅ {\displaystyle \scriptstyle 37\cdot 43\cdot 53\cdot \,} 61 ⋅ 71 ⋅ 79 {\displaystyle \scriptstyle 61\cdot 71\cdot 79\,}
The multiplicative (p2n,p2n+1)-Pascal triangle gives a Gödel encoding of the (an,bn)-Pascal triangle, i.e.:
where the exponents α i {\displaystyle \scriptstyle \alpha _{i}\,} are the coefficients in
where
For example:
corresponds to
The multiplicative (p2n,p2n+1)-Pascal triangle recursion rule is:
where p i , i ≥ 1 {\displaystyle \scriptstyle p_{i},\ i\geq 1\,} is the ith prime.