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!)
A243307 a(n) = 2^phi(n) + phi(n). 1

%I #16 Sep 08 2022 08:46:08

%S 3,3,6,6,20,6,70,20,70,20,1034,20,4108,70,264,264,65552,70,262162,264,

%T 4108,1034,4194326,264,1048596,4108,262162,4108,268435484,264,

%U 1073741854,65552,1048596,65552,16777240,4108,68719476772,262162,16777240,65552

%N a(n) = 2^phi(n) + phi(n).

%H Vincenzo Librandi, <a href="/A243307/b243307.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = A066781(n) + A000010(n). - _Wesley Ivan Hurt_, Jun 04 2014

%e From _Muniru A Asiru_, Jan 23 2018: (Start)

%e phi(1) = 1 -> a(1) = 2^1 + 1 = 3.

%e phi(2) = 1 -> a(2) = 2^1 + 1 = 3.

%e phi(7) = 6 -> a(7) = 2^6 + 6 = 70.

%e phi(10) = 4 -> a(10) = 2^4 + 4 = 20.

%e (End)

%p with(numtheory); A243307:=n->2^phi(n)+phi(n); seq(A243307(n), n=1..50); # _Wesley Ivan Hurt_, Jun 04 2014

%t Table[2^EulerPhi[n] + EulerPhi[n], {n, 1, 50}]

%o (Magma) [2^EulerPhi(n)+EulerPhi(n): n in [1..40]];

%o (GAP) List([1..1000], n -> 2^Phi(n) + Phi(n)); # _Muniru A Asiru_, Jan 23 2018

%Y Cf. A066781, A100371.

%K nonn

%O 1,1

%A _Vincenzo Librandi_, Jun 04 2014

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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)