A292590 a(1) = 0; and for n > 1, a(n) = 2*a(A285712(n)) + [0 == (n mod 3)].

0, 0, 1, 2, 0, 5, 10, 2, 21, 42, 4, 85, 0, 0, 171, 342, 10, 5, 684, 20, 1369, 2738, 4, 5477, 0, 42, 10955, 8, 84, 21911, 43822, 8, 21, 87644, 170, 175289, 350578, 0, 11, 701156, 0, 1402313, 40, 342, 2804627, 16, 684, 85, 5609254, 20, 11218509, 22437018, 10, 44874037, 89748074, 1368, 179496149, 168, 40, 43, 0, 2738, 1, 358992298, 5476, 717984597, 80, 8

Offset

1,4

Comments

Binary expansion of a(n) encodes the positions of multiples of three in the path taken from n to the root in the binary trees like A245612 and A244154.

Links

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

Index entries for sequences related to binary expansion of n

Index entries for sequences computed from indices in prime factorization

Formula

a(1) = 0; and for n > 1, a(n) = A079978(n) + 2*a(A285712(n)).

a(n) + A292591(n) = A245611(n).

a(A245612(n)) = A292592(n).

A000120(a(n)) = A292594(n).

Mathematica

f[n_] := f[n] = Which[n == 1, 0, Mod[n, 3] == 2, Ceiling[n/3], True, (Times @@ Power[If[# == 1, 1, NextPrime[#, -1]] & /@ First@ #, Last@ #] &@ Transpose@ FactorInteger[2 n - 1] + 1)/2]; a[n_] := a[n] = If[n == 1, n - 1, 2 a[f@ n] + Boole[Divisible[n, 3]]]; Array[a, 67] (* Michael De Vlieger, Sep 22 2017 *)

Prog

(Scheme) (define (A292590 n) (if (<= n 1) 0 (+ (if (zero? (modulo n 3)) 1 0) (* 2 (A292590 (A285712 n))))))

Crossrefs

Cf. A079978, A244153, A245611, A285712, A292591, A292592, A292594.

Cf. also A292244, A292383.

Sequence in context: A011014 A002976 A358305 * A080901 A137260 A263101

Adjacent sequences: A292587 A292588 A292589 * A292591 A292592 A292593

Keyword

nonn

Author

Antti Karttunen, Sep 20 2017

Status

approved