References
- G. Bilgici, Two generalizations of Lucas sequence, Appl. Math. Comput. 245 (2014), 526-538. https://doi.org/10.1016/j.amc.2014.07.111
- C. Cooper, An identity for period k second order linear recurrence systems, Congr. Numer. 200 (2010), 95-106.
- M. Edson and O. Yayenie, A new generalization of Fibonacci sequence and extended Binet's formula, Integers 9 (2009), no. 6, 639-654. https://doi.org/10.1515/INTEG.2009.051
- D. Laksov, Linear recurring sequences over finite fields, Math. Scand. 16 (1965), 181-196. https://doi.org/10.7146/math.scand.a-10759
- J. Ma and J. Holdener, When Thue-Morse meets Koch, Fractals 13 (2005), no. 3, 191-206. https://doi.org/10.1142/S0218348X05002908
- OEIS Foundation Inc., The On-Line Encyclopedia of Integer Sequences, 2011; https://oeis.org.
- W. W. Peterson, Encoding and error-correction procedures for the Bose-Chaudhuri codes, Trans. IRE IT-6 (1960), 459-470. https://doi.org/10.1109/tit.1960.1057586
- Python Software Foundation, Python Language Reference, version 2.7.
- O. Yayenie, A note on generalized Fibonacci sequences, Appl. Math. Comput. 217 (2011), no. 12, 5603-5611. https://doi.org/10.1016/j.amc.2010.12.038
- O. Yayenie, New identities for generalized Fibonacci sequences and new generalization of Lucas sequences, Southeast Asian Bull. Math. 36 (2012), no. 5, 739-752.