Equation (1) is also satisfied by some other second-order recurring sequences of integers, e.g., Pell numbers or Fibonacci polynomials evaluated at a fixed integer (cf. [1]). In [3], Clark Kimberling… Expand

Several scholars have criticized the efforts to explain Indian mantras as spells, but much is left to clarification. Why do submission-versus-coercion characterizations keep reoccurring, albeit… Expand

(u,9 u.) = |w ( i f J ) | f o r a H i9 j > 19 (1) is.called a k-order strong divisibility sequence. A complete characterization of all the second-order strong divisibility sequences was given in [1]… Expand