Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A351556
a(n) = gcd(n, A019565(n)).
4
1, 1, 1, 3, 1, 5, 3, 1, 1, 1, 1, 1, 1, 1, 7, 15, 1, 1, 3, 1, 5, 1, 11, 1, 1, 1, 1, 3, 7, 1, 15, 1, 1, 1, 1, 1, 1, 1, 1, 39, 1, 1, 21, 1, 1, 5, 1, 1, 1, 1, 1, 3, 13, 1, 3, 55, 7, 1, 1, 1, 5, 1, 1, 21, 1, 1, 3, 1, 17, 1, 5, 1, 1, 1, 1, 3, 1, 7, 3, 1, 1, 1, 1, 1, 1, 85, 1, 3, 11, 1, 3, 7, 1, 1, 1, 5, 1, 1, 1, 3, 5, 1, 51, 1, 13, 7
(list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
Antti Karttunen, Table of n, a(n) for n = 0..65537
Index entries for sequences related to binary expansion of n
Index entries for sequences computed from indices in prime factorization
FORMULA
a(n) = gcd(n, A019565(n)) = gcd(A007947(n), A019565(n)).
a(n) = A007947(a(n)).
a(n) = A019565(A351558(n)).
MATHEMATICA
Table[GCD[n, Times @@ Prime@ Flatten@ Position[Reverse@ IntegerDigits[n, 2], 1]], {n, 0, 105}] (* Michael De Vlieger, Feb 20 2022 *)
PROG
(PARI)
A019565(n) = { my(m=1, p=1); while(n>0, p = nextprime(1+p); if(n%2, m *= p); n >>= 1); (m); };
A351556(n) = gcd(n, A019565(n));
CROSSREFS
Cf. A007947, A019565.
Cf. also A324198, A351549, A351557, A351558.
Sequence in context: A059971 A184343 A099548 * A134743 A099547 A137758
Adjacent sequences: A351553 A351554 A351555 * A351557 A351558 A351559
KEYWORD
nonn,look
AUTHOR
Antti Karttunen, Feb 19 2022
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified September 28 10:43 EDT 2024. Contains 376292 sequences.
License Agreements, Terms of Use, Privacy Policy