login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A378888
a(n) = gcd(n, A007814(n)).
0
1, 1, 3, 2, 5, 1, 7, 1, 9, 1, 11, 2, 13, 1, 15, 4, 17, 1, 19, 2, 21, 1, 23, 3, 25, 1, 27, 2, 29, 1, 31, 1, 33, 1, 35, 2, 37, 1, 39, 1, 41, 1, 43, 2, 45, 1, 47, 4, 49, 1, 51, 2, 53, 1, 55, 1, 57, 1, 59, 2, 61, 1, 63, 2, 65, 1, 67, 2, 69, 1, 71, 3, 73, 1, 75, 2
OFFSET
1,3
LINKS
FORMULA
a(2*n-1) = 2*n-1.
a(2*n) = A378887(n).
Sum_{k=1..n} a(k) ~ n^2/4 + c*n/2, where c = 1.62390224555724623579... is the asymptotic mean of A378887 (see the Formula section of A378887).
MATHEMATICA
a[n_] := GCD[n, IntegerExponent[n, 2]]; Array[a, 100]
PROG
(PARI) a(n) = gcd(n, valuation(n, 2));
CROSSREFS
Cf. A007814, A378887 (even bisection).
Sequence in context: A099643 A224344 A113260 * A051543 A265574 A129538
KEYWORD
nonn,easy,new
AUTHOR
Amiram Eldar, Dec 10 2024
STATUS
approved