A273665 a(0) = 0; for n >= 1: if n = A153880(k) for some k, then a(n) = 2*a(k), otherwise, n = A273670(h) for some h, and a(n) = 1 + 2*a(h).

0, 1, 2, 3, 5, 7, 4, 11, 6, 15, 9, 23, 10, 13, 14, 31, 19, 47, 21, 27, 29, 63, 39, 95, 8, 43, 22, 55, 59, 127, 12, 79, 30, 191, 17, 87, 18, 45, 46, 111, 119, 255, 25, 159, 61, 383, 35, 175, 20, 37, 26, 91, 93, 223, 28, 239, 62, 511, 51, 319, 38, 123, 94, 767, 71, 351, 41, 75, 53, 183, 187, 447, 42, 57, 54, 479, 125, 1023, 58

Offset

0,3

Links

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

Index entries for sequences related to factorial base representation

Index entries for sequences that are permutations of the natural numbers

Formula

a(0) = 0; for n >= 1: if A257680(A225901(n)) = 0 [i.e., n is one of the terms of A153880], then a(n) = 2*a(A266193(n)), otherwise [when n is one of the terms of A273670], a(n) = 1 + 2*a(A273663(n)).

Prog

(Scheme, with memoization-macro definec)
(definec (A273665 n) (cond ((zero? n) n) ((zero? (A257680 (A225901 n))) (* 2 (A273665 (A266193 n)))) (else (+ 1 (* 2 (A273665 (A273663 n)))))))

Crossrefs

Inverse: A273666.

Cf. A153880, A225901, A257680, A266193, A273663, A273670.

Related or similar permutations: A255565, A273667.

Sequence in context: A125151 A372130 A302024 * A212646 A369515 A103866

Adjacent sequences: A273662 A273663 A273664 * A273666 A273667 A273668

Keyword

nonn,base

Author

Antti Karttunen, May 30 2016

Status

approved