The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066781 a(n) = 2^phi(n). 12
 2, 2, 4, 4, 16, 4, 64, 16, 64, 16, 1024, 16, 4096, 64, 256, 256, 65536, 64, 262144, 256, 4096, 1024, 4194304, 256, 1048576, 4096, 262144, 4096, 268435456, 256, 1073741824, 65536, 1048576, 65536, 16777216, 4096, 68719476736, 262144, 16777216, 65536 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Harry J. Smith, Table of n, a(n) for n = 1..300 FORMULA From Amiram Eldar, Nov 18 2020: (Start) a(n) = 2^A000010(n). Sum_{n>=1} 1/a(n) = A334071. (End) MATHEMATICA Table[2^EulerPhi[n], {n, 40}] (* Arkadiusz Wesolowski, Jan 16 2013 *) PROG (PARI) a(n) = 2^eulerphi(n); \\ Harry J. Smith, Mar 25 2010 CROSSREFS Cf. A000010, A334071. Sequence in context: A280306 A140723 A106051 * A112869 A086117 A095240 Adjacent sequences:  A066778 A066779 A066780 * A066782 A066783 A066784 KEYWORD nonn AUTHOR Benoit Cloitre, Jan 18 2002 STATUS approved

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.

Last modified December 1 12:40 EST 2021. Contains 349429 sequences. (Running on oeis4.)