A292252 Number of trailing 2-digits in ternary representation of A048673(n).

0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 3, 0, 1, 0, 3, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 4, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1

Offset: 1

Author

Antti Karttunen, Sep 12 2017

Keywords

• nonn
• base

Links

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

Crossrefs

Cf. A007814, A007949, A048673, A291759, A292251 (even bisection subtracted by one).

Cf. also A292242, A292262.

Programs

Mathematica

If[First@ # == 2, Length@ #, 0] &@ Last@ Split@ IntegerDigits[#, 3] & /@ Table[(Times @@ Power[If[# == 1, 1, NextPrime@ #] & /@ First@ #, Last@ #] + 1)/2 &@ Transpose@ FactorInteger@ n, {n, 120}] (* Michael De Vlieger, Sep 12 2017 *)

Scheme

(define (A292252 n) (A007949 (+ 1 (A048673 n))))
(define (A292252 n) (A007814 (+ 1 (A291759 n))))
(define (A292252 n) (if (odd? n) 0 (+ 1 (A292251 (/ n 2)))))

Formula

a(n) = A007949(1+A048673(n)).

a(n) = A007814(1+A291759(n)).

a(2n) = 1 + A292251(n/2), a(2n+1) = 0.