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!)
A253274 Exponent of the highest power of 2 dividing A007497(n). 1

%I #17 Mar 27 2023 03:38:43

%S 1,0,2,0,3,0,3,2,3,5,3,6,2,12,3,13,3,9,6,13,10,9,7,13,9,13,5,14,6,12,

%T 11,26,0,14,15,17,6,20,15,18,17,35,10,8,23,11,15,10,16,29,32,12,19,27,

%U 25,26,18,24,33,22,36,13,24,18,24,43,16,29,35,18,12,42

%N Exponent of the highest power of 2 dividing A007497(n).

%H Amiram Eldar, <a href="/A253274/b253274.txt">Table of n, a(n) for n = 1..1500</a>

%F a(n) = A007814(A007497(n)).

%e A007497(9) = 168 = 2^3*3*7, so a(n) = 3.

%t f[1] = 2; f[n_] := f[n] = DivisorSigma[1, f[n - 1]]; Table[IntegerExponent[f[n], 2], {n, 70}] (* _Amiram Eldar_, Mar 27 2023 *)

%Y Cf. A007497, A007814.

%K nonn

%O 1,3

%A _Allan C. Wechsler_, May 01 2015

%E More terms from _Michel Marcus_, May 01 2015

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 August 12 12:15 EDT 2024. Contains 375092 sequences. (Running on oeis4.)