A275808 a(0) = 0, for n >= 1, a(n) = A275736(n) XOR a(A257684(n)), where XOR is given by A003987.

0, 1, 2, 3, 1, 0, 4, 5, 6, 7, 5, 4, 2, 3, 0, 1, 3, 2, 1, 0, 3, 2, 0, 1, 8, 9, 10, 11, 9, 8, 12, 13, 14, 15, 13, 12, 10, 11, 8, 9, 11, 10, 9, 8, 11, 10, 8, 9, 4, 5, 6, 7, 5, 4, 0, 1, 2, 3, 1, 0, 6, 7, 4, 5, 7, 6, 5, 4, 7, 6, 4, 5, 2, 3, 0, 1, 3, 2, 6, 7, 4, 5, 7, 6, 0, 1, 2, 3, 1, 0, 3, 2, 1, 0, 2, 3, 1, 0, 3, 2, 0

Offset

0,3

Links

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

Index entries for sequences related to factorial base representation

Formula

a(0) = 0, for n >= 1, a(n) = A275736(n) XOR a(A257684(n)), where 2-argument function XOR is given by A003987.

a(n) = A248663(A275734(n)).

Prog

(Scheme, with memoization-macro definec)
(definec (A275808 n) (if (zero? n) n (A003987bi (A275736 n) (A275808 (A257684 n))))) ;; Where A003987bi implements bitwise-XOR (A003987)

Crossrefs

Cf. A003987, A248663, A257684, A275734, A275736.

Cf. A275809 (positions of zeros), A275810 (and their first differences).

Cf. also A275728.

Sequence in context: A338753 A167666 A115352 * A038554 A362160 A356120

Adjacent sequences: A275805 A275806 A275807 * A275809 A275810 A275811

Keyword

nonn,base

Author

Antti Karttunen, Aug 09 2016

Status

approved