A short note on Layman permutations
A permutation p of [k] = {1, 2, 3, …, k} is called Layman permutation iff i + p(i) is a Fibonacci number for 1 ≤ i ≤ k. This concept is introduced by Layman in the A097082 entry of the Encyclopedia of Integers Sequences, that is the number of Layman permutations of [n]. In this paper, we will study...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2022-12-01
|
| Series: | Acta Universitatis Sapientiae: Mathematica |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/ausm-2022-0015 |