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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A354838 For n >= 1, a(n) = A007088(n)/gcd(n, A007088(n)). 1
1, 5, 11, 25, 101, 55, 111, 125, 1001, 101, 1011, 275, 1101, 555, 1111, 625, 10001, 5005, 10011, 505, 481, 5055, 10111, 1375, 11001, 5505, 11011, 2775, 11101, 1111, 11111, 3125, 9091, 50005, 100011, 25025, 100101, 50055, 100111, 2525, 101001, 2405, 101011, 25275 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
a(6) = A007088(6)/gcd(6, A007088(6)) = 110/gcd(6,110) = 110/2 = 55.
MATHEMATICA
a[n_] := (b = FromDigits[IntegerDigits[n, 2]])/GCD[n, b]; Array[a, 50] (* Amiram Eldar, Jun 08 2022 *)
PROG
(PARI) a(n) = numerator(fromdigits(binary(n))/n); \\ Kevin Ryde, Jun 09 2022
CROSSREFS
Sequence in context: A050344 A318033 A326161 * A038253 A372918 A274681
KEYWORD
nonn,base,easy
AUTHOR
Ctibor O. Zizka, Jun 08 2022
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 14 22:58 EDT 2024. Contains 375167 sequences. (Running on oeis4.)