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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324468 a(n) = r(n) + r(n+1) + r(n+2), where r(n) is the ruler sequence A007814. 1
 1, 3, 2, 3, 1, 4, 3, 4, 1, 3, 2, 3, 1, 5, 4, 5, 1, 3, 2, 3, 1, 4, 3, 4, 1, 3, 2, 3, 1, 6, 5, 6, 1, 3, 2, 3, 1, 4, 3, 4, 1, 3, 2, 3, 1, 5, 4, 5, 1, 3, 2, 3, 1, 4, 3, 4, 1, 3, 2, 3, 1, 7, 6, 7, 1, 3, 2, 3, 1, 4, 3, 4, 1, 3, 2, 3, 1, 5, 4, 5, 1, 3, 2, 3, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..10000 FORMULA 1 <= a(n) <= 1 + log_2(n+2). - Charles R Greathouse IV, Jul 01 2022 MATHEMATICA Table[Sum[IntegerExponent[n + k, 2], {k, 0, 2}], {n, 100}] (* Vincenzo Librandi, Mar 10 2019 *) PROG (Magma) [&+[Valuation(n+k, 2): k in [0..2]]: n in [1..70]]; // Vincenzo Librandi, Mar 10 2019 (PARI) a(n) = sum(k=0, 2, valuation(n+k, 2)); \\ Michel Marcus, Mar 10 2019 (Python) def A324468(n): return (~n & n-1).bit_length()+(~(n+1) & n).bit_length()+(~(n+2) & n+1).bit_length() # Chai Wah Wu, Jul 01 2022 CROSSREFS Cf. A001511, A007814, A050603 (r(n)+r(n+1)), A324465. Sequence in context: A213940 A236027 A220128 * A131498 A236455 A033093 Adjacent sequences: A324465 A324466 A324467 * A324469 A324470 A324471 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Mar 03 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 29 21:17 EDT 2023. Contains 363042 sequences. (Running on oeis4.)