|
| |
|
|
A329906
|
|
a(0) = 1; a(1) = 2; after which a(2n) = A329898(a(n)), a(2n+1) = A330683(a(n)).
|
|
6
|
|
|
|
1, 2, 3, 4, 5, 11, 6, 9, 7, 23, 15, 38, 8, 20, 13, 22, 10, 44, 30, 110, 19, 69, 49, 128, 12, 41, 27, 72, 17, 43, 29, 54, 14, 79, 56, 272, 37, 181, 136, 482, 26, 118, 86, 307, 61, 208, 156, 424, 16, 73, 52, 190, 34, 123, 89, 242, 24, 77, 55, 147, 36, 93, 66, 114, 18, 131, 97, 596, 68, 416, 323, 1448, 48, 286, 218, 990, 164, 711
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
COMMENTS
|
Note the indexing: domain begins from zero, but the range does not include it.
|
|
|
LINKS
|
Table of n, a(n) for n=0..77.
Index entries for sequences that are permutations of the natural numbers
|
|
|
FORMULA
|
a(0) = 1; a(1) = 2; after which a(2n) = A329898(a(n)), a(2n+1) = A330683(a(n)).
a(n) = A329901(A163511(n)).
|
|
|
EXAMPLE
|
This irregular table can be represented as a binary tree. Each child to the left is obtained by applying A329898 the parent, and each child to the right is obtained by applying A330683 to the parent:
1
|
...................2...................
3 4
5......../ \........11 6......../ \........9
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
7 23 15 38 8 20 13 22
10 44 30 110 19 69 49 128 12 41 27 72 17 43 29 54
etc.
|
|
|
PROG
|
(PARI) A329906(n) = if(n<2, 1+n, if(!(n%2), A329898(A329906(n/2)), A330683(A329906(n\2))));
|
|
|
CROSSREFS
|
Cf. A329905 (inverse permutation).
Cf. A163511, A181815, A329897, A329898, A329901, A330683.
Sequence in context: A111666 A080475 A247233 * A325651 A160000 A245448
Adjacent sequences: A329903 A329904 A329905 * A329907 A329908 A329909
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Antti Karttunen, Dec 24 2019
|
|
|
STATUS
|
approved
|
| |
|
|
