login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A372469 a(n) = log_2(A372468(n)). 3
0, 1, 1, 1, 2, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 3, 2, 2, 1, 3, 1, 2, 2, 2, 1, 2, 2, 3, 1, 3, 1, 2, 1, 2, 1, 3, 2, 3, 2, 2, 1, 1, 2, 2, 3, 1, 2, 3, 1, 1, 2, 2, 3, 1, 2, 1, 2, 2, 2, 3, 1, 2, 2, 2, 2, 1, 1, 3, 1, 3, 3, 2, 1, 1, 3, 2, 1, 3, 2, 2, 2, 4, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
MATHEMATICA
f[n_] := Module[{p = Times @@ (1 + FactorInteger[n][[;; , 2]]), e}, e = IntegerExponent[p, 2]; If[p == 2^e, e, Nothing]]; f[1] = 0; Array[f, 150]
PROG
(PARI) lista(kmax) = {my(p, e); for(k = 1, kmax, p = vecprod(apply(x -> x + 1, factor(k)[, 2])); e = valuation(p, 2); if(p >> e == 1, print1(e, ", "))); }
CROSSREFS
Cf. A372468.
Sequence in context: A332292 A054350 A026606 * A265918 A207676 A161175
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, May 02 2024
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 17 23:27 EDT 2024. Contains 374377 sequences. (Running on oeis4.)