login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A306354 a(n) = gcd(n, A101337(n)). 2

%I

%S 1,2,3,4,5,6,7,8,9,1,1,1,1,1,1,1,1,1,1,4,1,2,1,4,1,2,1,4,1,3,1,1,3,1,

%T 1,9,1,1,3,8,1,2,1,4,1,2,1,16,1,25,1,1,1,1,5,1,1,1,1,12,1,2,9,4,1,6,1,

%U 4,3,7,1,1,1,1,1,1,7,1,1,16,1,2,1,4,1,2,1,8,1,9

%N a(n) = gcd(n, A101337(n)).

%C A101337(n) / n = r, r an integer, gives A306360. A101337(n) / n = 1 gives A005188. n / A101337(n) = s, s an integer, gives A306361. The motivation for this sequence was the question as to which numbers n have the property A101337(n) / n = r and the property n / A101337(n) = s?

%e For n = 24, a(24) = gcd(24, 2*2 + 4*4) = gcd(24,20) = 4, thus a(24) = 4;

%e for n = 153, a(153) = gcd(153, 1*1*1 + 5*5*5 + 3*3*3) = gcd(153,153) = 153, thus a(153) = 153.

%t Array[GCD[#1, Total[#2^Length[#2]]] & @@ {#, IntegerDigits@ #} &, 90] (* _Michael De Vlieger_, Feb 09 2019 *)

%o (PARI) a(n) = my(d=digits(n)); gcd(n, sum(i=1, #d, d[i]^#d)); \\ _Michel Marcus_, Feb 12 2019

%Y Cf. A005188, A066750, A101337.

%K nonn,base

%O 1,2

%A _Ctibor O. Zizka_, Feb 09 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 22:27 EST 2019. Contains 329880 sequences. (Running on oeis4.)