OFFSET
0,2
COMMENTS
Note the indexing: the domain starts from 0, while the range excludes zero.
From Antti Karttunen, May 30 2017: (Start)
This sequence can be represented as a binary tree. Each left hand child is obtained by applying A254049(n) when the parent contains n, and each right hand child is obtained by applying A016789(n-1) (i.e., multiply by 3, subtract one) to the parent's contents:
1
|
...................2...................
3 5
4......../ \........8 13......../ \........14
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
6 11 18 23 25 38 63 41
7 17 28 32 39 53 88 68 61 74 123 113 172 188 313 122
etc.
This is a mirror image of the tree depicted in A245612.
(End)
LINKS
FORMULA
PROG
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Antti Karttunen, Jun 27 2014
STATUS
approved