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.
%I A243307 #16 Sep 08 2022 08:46:08
%S A243307 3,3,6,6,20,6,70,20,70,20,1034,20,4108,70,264,264,65552,70,262162,264,
%T A243307 4108,1034,4194326,264,1048596,4108,262162,4108,268435484,264,
%U A243307 1073741854,65552,1048596,65552,16777240,4108,68719476772,262162,16777240,65552
%N A243307 a(n) = 2^phi(n) + phi(n).
%H A243307 Vincenzo Librandi, <a href="/A243307/b243307.txt">Table of n, a(n) for n = 1..1000</a>
%F A243307 a(n) = A066781(n) + A000010(n). - _Wesley Ivan Hurt_, Jun 04 2014
%e A243307 From _Muniru A Asiru_, Jan 23 2018: (Start)
%e A243307 phi(1) = 1 -> a(1) = 2^1 + 1 = 3.
%e A243307 phi(2) = 1 -> a(2) = 2^1 + 1 = 3.
%e A243307 phi(7) = 6 -> a(7) = 2^6 + 6 = 70.
%e A243307 phi(10) = 4 -> a(10) = 2^4 + 4 = 20.
%e A243307 (End)
%p A243307 with(numtheory); A243307:=n->2^phi(n)+phi(n); seq(A243307(n), n=1..50); # _Wesley Ivan Hurt_, Jun 04 2014
%t A243307 Table[2^EulerPhi[n] + EulerPhi[n], {n, 1, 50}]
%o A243307 (Magma) [2^EulerPhi(n)+EulerPhi(n): n in [1..40]];
%o A243307 (GAP) List([1..1000], n -> 2^Phi(n) + Phi(n)); # _Muniru A Asiru_, Jan 23 2018
%Y A243307 Cf. A066781, A100371.
%K A243307 nonn
%O A243307 1,1
%A A243307 _Vincenzo Librandi_, Jun 04 2014