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.

A243307 a(n) = 2^phi(n) + phi(n).

Original entry on oeis.org

3, 3, 6, 6, 20, 6, 70, 20, 70, 20, 1034, 20, 4108, 70, 264, 264, 65552, 70, 262162, 264, 4108, 1034, 4194326, 264, 1048596, 4108, 262162, 4108, 268435484, 264, 1073741854, 65552, 1048596, 65552, 16777240, 4108, 68719476772, 262162, 16777240, 65552
Offset: 1

Views

Author

Vincenzo Librandi, Jun 04 2014

Keywords

Examples

			From _Muniru A Asiru_, Jan 23 2018: (Start)
phi(1) = 1 -> a(1) = 2^1 + 1 = 3.
phi(2) = 1 -> a(2) = 2^1 + 1 = 3.
phi(7) = 6 -> a(7) = 2^6 + 6 = 70.
phi(10) = 4 -> a(10) = 2^4 + 4 = 20.
(End)
		

Crossrefs

Programs

  • GAP
    List([1..1000], n -> 2^Phi(n) + Phi(n)); # Muniru A Asiru, Jan 23 2018
  • Magma
    [2^EulerPhi(n)+EulerPhi(n): n in [1..40]];
    
  • Maple
    with(numtheory); A243307:=n->2^phi(n)+phi(n); seq(A243307(n), n=1..50); # Wesley Ivan Hurt, Jun 04 2014
  • Mathematica
    Table[2^EulerPhi[n] + EulerPhi[n], {n, 1, 50}]

Formula

a(n) = A066781(n) + A000010(n). - Wesley Ivan Hurt, Jun 04 2014