Corpus ID: 117522121

A CHARACTERIZATION OF THE SECOND-ORDER STRONG DIVISIBILITY SEQUENCES

@inproceedings{Hork2010ACO,
  title={A CHARACTERIZATION OF THE SECOND-ORDER STRONG DIVISIBILITY SEQUENCES},
  author={P. Hor{\'a}k},
  year={2010}
}
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 put a question: Which recurrent sequences satisfy the equation (1)? In our paper, we answer this question for a certain class of recurring sequences, namely that of the second-order linear recurrent sequences of integers. We shall study the sequences u = {un:n = 1, 2, ...} of integers defined by u1… Expand
8 Citations
On the GCD-s of k consecutive terms of Lucas sequences☆
  • 7
  • Highly Influenced
THE FIBONACCI QUARTERLY
  • 34
  • PDF
Divisibility in generalized Fibonacci sequences
  • PDF
Lucas' theorem: its generalizations, extensions and applications (1878--2014)
  • 6
  • PDF
Balancing diophantine triples
  • 9
  • PDF

References

SHOWING 1-5 OF 5 REFERENCES
δ-Fibonacci numbers
  • 103
  • Highly Influential
  • PDF
A Primer on the Pell Sequence and Related Sequences.
  • The Fibonacci Quarterly 13,
  • 1975
Boston: Houghton-Mifflin, 1969; rpt. The Fibonacci Association
  • Boston: Houghton-Mifflin, 1969; rpt. The Fibonacci Association
  • 1980
Fibonacci and Lucas Numbers. Boston: Houghton-Mifflin, 1969; rpt
  • The Fibonacci Association, Santa Clara, California,
  • 1980