The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A292252 Number of trailing 2-digits in ternary representation of A048673(n). 5
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 FORMULA a(n) = A007949(1+A048673(n)). a(n) = A007814(1+A291759(n)). a(2n) = 1 + A292251(n/2), a(2n+1) = 0. 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 *) PROG (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))))) CROSSREFS Cf. A007814, A007949, A048673, A291759, A292251 (even bisection subtracted by one). Cf. also A292242, A292262. Sequence in context: A256003 A157187 A152140 * A244415 A104975 A191254 Adjacent sequences:  A292249 A292250 A292251 * A292253 A292254 A292255 KEYWORD nonn,base AUTHOR Antti Karttunen, Sep 12 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 23 16:19 EST 2020. Contains 332176 sequences. (Running on oeis4.)