login
A377738
a(n) is the least m > n such that the Zeckendorf representations of m and n have the same number of terms.
1
2, 3, 5, 6, 8, 7, 9, 13, 10, 11, 14, 17, 21, 15, 16, 18, 19, 22, 20, 25, 34, 23, 24, 26, 27, 29, 28, 30, 35, 31, 32, 38, 46, 55, 36, 37, 39, 40, 42, 41, 43, 47, 44, 45, 48, 51, 56, 49, 50, 52, 53, 59, 54, 67, 89, 57, 58, 60, 61, 63, 62, 64, 68, 65, 66, 69, 72
OFFSET
1,1
COMMENTS
A permutation of the numbers missing from A027941.
To compute a(n):
- in the Zeckendorf representation of n,
- locate the rightmost term A000045(k) such that A000045(k+2) is not a term,
- replace A000045(k) by A000045(k+1),
- replace the c terms < A000045(k) by A027941(c).
FORMULA
a(A000045(k)) = A000045(k+1) for any k >= 2.
EXAMPLE
The first terms, alongside their Zeckendorf representations, are:
n a(n) A014417(n) A014417(a(n))
-- ---- ---------- -------------
1 2 1 10
2 3 10 100
3 5 100 1000
4 6 101 1001
5 8 1000 10000
6 7 1001 1010
7 9 1010 10001
8 13 10000 100000
9 10 10001 10010
10 11 10010 10100
11 14 10100 100001
12 17 10101 100101
13 21 100000 1000000
14 15 100001 100010
PROG
(PARI) \\ See Links section.
KEYWORD
nonn,base
AUTHOR
Rémy Sigrist, Nov 05 2024
STATUS
approved