On an Integer Sequence via Euler ϕ Function

Binu K P^{1, 2}, Vinod S^{1, 2} and K Vishnu Namboothiri^{3, 2,}

¹Department of Mathematics, Government College for Women, Thiruvananthapuram, Kerala, India

²Department of Collegiate Education, Government of Kerala, India

³Department of Mathematics, Government College, Ambalapuzha, Kerala, India

Cite this paper

Binu K P, Vinod S and K Vishnu Namboothiri. On an Integer Sequence via Euler ϕ Function. American Journal of Applied Mathematics and Statistics. 2019; 7(3):112-114. doi: 10.12691/AJAMS-7-3-5

Abstract

Similar to Fibonacci sequence and Lucas sequences that are recursively defined we define an integer sequence using the Euler totient function ϕ and study some of its properties. We also verify that the sequence we have defined has some properties similar to Fibonacci sequence, but even then it is not a Lucas sequence.

Keywords

Fibonacci sequence, Lucas sequence, Euler ϕ function, integer sequences, perfect numbers

Copyright

This work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

References

[1]	Florian Luca. Perfect fbonacci and lucas numbers. Rendiconti del Circolo Matematico di Palermo, 49(2):313-318, 2000.
[2]	Florian Luca, V Janitzio Mejia Huguet, Av San Pablo, and Florin Nicolae. On the euler function of fbonacci numbers. Journal of Integer Sequences, 12(2):3, 2009.
[3]	Marian Muresan. A concrete approach to classical analysis, volume 14. Springer, 2009.
[4]	Waclaw Sierpinski. Elementary Theory of Numbers: Second English Edition (edited by A. Schinzel), volume 31. Elsevier, 1988.