Sep 6, 2021 · We consider sequences defined by a two termed linear recurrence with constant coefficients having some particular properties and investigate on ...

Nov 26, 2022 · A Gray code is a particular list of combinatorial objects of a class where two consecutive objects differ as little as possible, ie, in Gray code order.

Apr 21, 2022 · We analyse the case of k-generalized Fibonacci sequences leading to the binary strings avoiding 1^k. We prove a bijection between the set %F_n^ ...

Sep 13, 2021 · We consider sequences defined by a two termed linear recurrence with constant coefficients having some particular properties and investigate on ...

Nov 26, 2022 · A Gray code is a particular list of combinatorial objects of a class where two consecutive objects differ as little as possible, ie, in Gray code order.

In [4] a very simple and general system of numeration is presented, based on a strictly increasing integer sequence and an iterating division algorithm. Each.

Apr 21, 2022 · Each positive increasing integer sequence {an}n≥0 can serve as a numeration system to represent each non-negative integer by means of suitable ...

We consider sequences defined by a two termed linear recurrence with constant coefficients having some particular properties and investigate on the possibility ...

Nov 26, 2022 · Finally, basing on a known Gray code for those strings, we define a Gray code for S n + 1 ( 321, 312, 234 … ( k + 1 ) 1 ), where two consecutive ...

Each strictly increasing sequence of positive integers can be used to define a numeration system so that any non-negative integer can be represented.