A253888 a(0) = 1; for n >= 1: a(n) = A048673(1+(2*A064216(n))).

1, 3, 4, 6, 7, 13, 18, 15, 9, 63, 39, 28, 43, 12, 10, 27, 31, 16, 19, 138, 88, 123, 45, 25, 78, 48, 30, 81, 24, 73, 55, 105, 22, 36, 108, 72, 438, 111, 21, 37, 303, 33, 148, 42, 93, 87, 103, 213, 54, 91, 58, 298, 171, 34, 363, 165, 172, 198, 102, 49, 69, 163, 76, 46, 115, 228, 333, 288, 61, 135, 319, 90, 130, 75, 52

Offset

0,2

Comments

When A048673 is represented as a binary tree, then the node k which contains value n = A048673(k) has as its right child a(n) = A048673(2k+1).

Links

Antti Karttunen, Table of n, a(n) for n = 0..8192

Formula

a(0) = 1; for n >= 1: a(n) = A048673(1+(2*A064216(n))).

Also, for n >= 1: a(n) = A254049(1+A064216(n)).

Prog

(Scheme, two versions)
(define (A253888 n) (if (zero? n) 1 (A048673 (+ 1 (* 2 (A064216 n))))))
(define (A253888 n) (if (zero? n) 1 (A254049 (+ 1 (A064216 n)))))

Crossrefs

Same sequence sorted into ascending order: A032766.

Also a permutation of A254049.

Cf. A048673, A064216, A253889, A253890, A254051, A254053.

Sequence in context: A326422 A093707 A058639 * A289811 A161001 A168170

Adjacent sequences: A253885 A253886 A253887 * A253889 A253890 A253891

Keyword

nonn

Author

Antti Karttunen, Jan 22 2015

Status

approved