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!)
 A324906 Number of trailing 1-bits in the binary representation of A318466(n), where A318466(n) = 2*n OR sigma(n). 3
 2, 3, 0, 4, 0, 0, 0, 5, 5, 0, 0, 0, 0, 0, 0, 6, 0, 3, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 1, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(n) = A007814(1+A318466(n)). MATHEMATICA Array[LengthWhile[Reverse@ IntegerDigits[BitOr[2 #, DivisorSigma[1, #]], 2], # == 1 &] &, 105] (* Michael De Vlieger, Mar 30 2019 *) PROG (PARI) A318466(n) = bitor(2*n, sigma(n)); A324906(n) = valuation(1+A318466(n), 2); CROSSREFS Cf. A000203, A003986, A007814, A318466, A324904, A324908. Sequence in context: A161628 A244119 A122059 * A164917 A166238 A293275 Adjacent sequences:  A324903 A324904 A324905 * A324907 A324908 A324909 KEYWORD nonn AUTHOR Antti Karttunen, Mar 28 2019 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 September 24 04:19 EDT 2020. Contains 337317 sequences. (Running on oeis4.)