OFFSET
0,3
COMMENTS
This sequence is a permutation of the nonnegative integers (with inverse A343313):
- we can always extend the sequence with a member of A003462 sufficiently large,
- so the sequence is infinite and unbounded,
- once we have a k-digit number and before introducing a number with more than k digits, we must use A003462(k),
- so we have infinitely many terms of A003462 in this sequence,
- for any m with k digits, we have infinitely many terms of A003462 > m in the sequence, each of these terms can be followed by m, so m must eventually appear.
Apparently:
- the sequence preserves the number of digits in balanced ternary representation (A134021),
- fixed points correspond to 0 and A007051.
LINKS
Rémy Sigrist, Table of n, a(n) for n = 0..9842
Rémy Sigrist, Scatterplot of the sequence for n = 0..3^9
Rémy Sigrist, PARI program for A343312
FORMULA
EXAMPLE
The first terms, alongside their balanced ternary representation (with "T" instead of digits "-1"), are:
n a(n) bter(a(a))
-- ---- ----------
0 0 0
1 1 1
2 2 1T
3 4 11
4 3 10
5 5 1TT
6 13 111
7 6 1T0
8 11 11T
9 7 1T1
10 12 110
11 8 10T
12 10 101
13 9 100
14 14 1TTT
15 40 1111
16 15 1TT0
17 38 111T
PROG
(PARI) See Links section.
CROSSREFS
KEYWORD
AUTHOR
Rémy Sigrist, Apr 11 2021
STATUS
approved