OFFSET
1,2
COMMENTS
For every choice of integers r and s, the polynomials p(n,x) form a strong divisibility sequence. Thus, if r, s, and x are integers, then p(x,n) is a strong divisibility sequence. That is, gcd(p(x,h),p(x,k)) = p(x,gcd(h,k)).
EXAMPLE
First seven rows:
1
5 2
19 15 3
65 76 30 4
211 325 190 50 5
665 1266 975 380 75 6
2059 4655 4431 2275 665 105 7
MATHEMATICA
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, Nov 01 2019
STATUS
approved