A280502 a(n) = A280500(n, A280501(n)).

1, 2, 3, 4, 5, 1, 1, 8, 3, 3, 11, 2, 13, 2, 15, 16, 17, 1, 1, 1, 1, 22, 23, 4, 25, 26, 5, 4, 29, 5, 31, 32, 33, 15, 13, 2, 37, 2, 39, 2, 41, 2, 43, 44, 15, 13, 47, 8, 11, 50, 51, 52, 3, 3, 55, 8, 57, 11, 59, 3, 61, 62, 3, 64, 5, 31, 67, 5, 69, 26, 71, 4, 73, 74, 75, 4, 77, 29, 25, 4, 81, 82, 29, 4, 85, 25, 87, 88, 89, 5, 91, 26, 31, 94, 5, 16, 97, 22, 99, 100, 23, 17

Offset

1,2

Links

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

Index entries for sequences related to binary expansion of n

Index entries for sequences operating on polynomials in ring GF(2)[X]

Formula

a(n) = A280500(n, A280501(n)).

Other identities. For all n >= 1:

A048720(a(n), A280501(n)) = n.

Prog

(Scheme) (define (A280502 n) (A280500bi n (A280501 n))) ;; Code for A280500bi given in A280500.

Crossrefs

Cf. A193231, A280500, A280501, A280506, A280507.

Cf. A118666 (positions of ones).

Sequence in context: A277544 A190595 A338863 * A276757 A290397 A322425

Adjacent sequences: A280499 A280500 A280501 * A280503 A280504 A280505

Keyword

nonn,base

Author

Antti Karttunen, Jan 09 2017

Status

approved