cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A354838 For n >= 1, a(n) = A007088(n)/gcd(n, A007088(n)).

This page as a plain text file.
%I A354838 #16 Jul 02 2022 14:43:46
%S A354838 1,5,11,25,101,55,111,125,1001,101,1011,275,1101,555,1111,625,10001,
%T A354838 5005,10011,505,481,5055,10111,1375,11001,5505,11011,2775,11101,1111,
%U A354838 11111,3125,9091,50005,100011,25025,100101,50055,100111,2525,101001,2405,101011,25275
%N A354838 For n >= 1, a(n) = A007088(n)/gcd(n, A007088(n)).
%e A354838 a(6) = A007088(6)/gcd(6, A007088(6)) = 110/gcd(6,110) = 110/2 = 55.
%t A354838 a[n_] := (b = FromDigits[IntegerDigits[n, 2]])/GCD[n, b]; Array[a, 50] (* _Amiram Eldar_, Jun 08 2022 *)
%o A354838 (PARI) a(n) = numerator(fromdigits(binary(n))/n); \\ _Kevin Ryde_, Jun 09 2022
%Y A354838 Cf. A007088, A076775, A354837.
%K A354838 nonn,base,easy
%O A354838 1,2
%A A354838 _Ctibor O. Zizka_, Jun 08 2022