Sequences of consecutive factoradic happy numbers
From MaRDI portal
Abstract: Given a positive integer , the factorial base representation of is given by , where and for all . For , we define by and , for . For , we let denote the -th iteration of , while . If satisfies , then we say that is an -power factoradic fixed point of . Moreover, given , if is an -power factoradic fixed point and if there exists such that , then we say that is an -power factoradic -happy number. Note an integer is said to be an -power factoradic happy number if it is an -power factoradic -happy number. In this paper, we prove that all positive integers are -power factoradic happy and, for , we prove the existence of arbitrarily long sequences of -power factoradic -happy numbers. A curious result establishes that for any the -power factoradic fixed points of that are greater than , always appear in sets of consecutive pairs. Our last contribution, provides the smallest sequences of consecutive -power factoradic happy numbers for , for some values of .
Recommendations
Cites work
- Generalized happy numbers
- scientific article; zbMATH DE number 1229490 (Why is no real title available?)
- scientific article; zbMATH DE number 486467 (Why is no real title available?)
- On consecutive happy numbers
- On generalizing happy numbers to fractional-base number systems
- On happy numbers.
- On the density of happy numbers
- Sequences of consecutive happy numbers
- Sequences of consecutive happy numbers in negative bases
- Smallest examples of strings of consecutive happy numbers
Cited in
(5)
This page was built for publication: Sequences of consecutive factoradic happy numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2204743)