A292588 Compound filter: a(n) = P(A292582(n), A292583(n)), where P(n,k) is sequence A000027 used as a pairing function.

1, 1, 2, 3, 2, 2, 4, 6, 3, 2, 7, 5, 7, 4, 4, 10, 7, 3, 11, 5, 2, 7, 16, 9, 3, 7, 9, 8, 16, 4, 22, 15, 4, 7, 7, 21, 22, 11, 11, 9, 22, 2, 29, 12, 5, 16, 37, 14, 3, 3, 11, 12, 37, 9, 4, 13, 7, 16, 46, 8, 46, 22, 8, 28, 4, 4, 56, 12, 11, 7, 67, 36, 67, 22, 5, 17, 7, 11, 79, 14, 10, 22, 92, 5, 11, 29, 22, 18, 92, 5, 7, 23, 16, 37, 16, 20, 92, 3, 122, 21, 92, 11

Offset

1,3

Comments

A filter constructed from the runlengths of numbers of the form 4k+0 and the runlengths of numbers of the form 4k+3 encountered in trajectories of A005940-tree.

Links

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

Index entries for sequences computed from indices in prime factorization

Formula

a(n) = (1/2)*(2 + ((A292582(n) + A292583(n))^2) - A292582(n) - 3*A292583(n)).

Crossrefs

Cf. A000027, A292582, A292583, A292584, A292587.

Sequence in context: A053269 A163873 A309563 * A335965 A225176 A349271

Adjacent sequences: A292585 A292586 A292587 * A292589 A292590 A292591

Keyword

nonn

Author

Antti Karttunen, Sep 26 2017

Status

approved