A099545 Odd part of n, modulo 4.
1, 1, 3, 1, 1, 3, 3, 1, 1, 1, 3, 3, 1, 3, 3, 1, 1, 1, 3, 1, 1, 3, 3, 3, 1, 1, 3, 3, 1, 3, 3, 1, 1, 1, 3, 1, 1, 3, 3, 1, 1, 1, 3, 3, 1, 3, 3, 3, 1, 1, 3, 1, 1, 3, 3, 3, 1, 1, 3, 3, 1, 3, 3, 1, 1, 1, 3, 1, 1, 3, 3, 1, 1, 1, 3, 3, 1, 3, 3, 1, 1, 1, 3, 1, 1, 3, 3, 3, 1, 1, 3, 3, 1, 3, 3, 3, 1, 1, 3, 1, 1, 3
Offset: 1
Examples
a(100) = 1: the odd part of 100 is 100/4 = 25, and 25 mod 4 = 1.
Links
- Michael De Vlieger, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
Mathematica
Array[Mod[#/(2^IntegerExponent[#, 2]), 4] &, 105] (* Michael De Vlieger, Feb 24 2021 *)
-
PARI
a(n)=bitand(n/(2^valuation(n,2)), 3); /* Joerg Arndt, Jul 18 2012 */
-
Python
def A099545(n): return n>>(~n&n-1).bit_length()&3 # Chai Wah Wu, Feb 26 2025
Formula
a(n) = 2 * A038189(n) + 1.
(a(n)-1)/2 = A014707(n). - Alexandre Wajnberg, Jan 02 2006
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 2. - Amiram Eldar, Aug 29 2024
Comments