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 A079395 #28 Feb 04 2024 01:14:35
%S A079395 2048,177147,48828125,1977326743,285311670611,1792160394037,
%T A079395 34271896307633,116490258898219,952809757913927,12200509765705829,
%U A079395 25408476896404831,177917621779460413,550329031716248441
%N A079395 a(n) = prime(n)^11.
%H A079395 Vincenzo Librandi, <a href="/A079395/b079395.txt">Table of n, a(n) for n = 1..1000</a>
%F A079395 From _Amiram Eldar_, Jan 24 2021: (Start)
%F A079395 Product_{n>=1} (1 + 1/a(n)) = zeta(11)/zeta(22).
%F A079395 Product_{n>=1} (1 - 1/a(n)) = 1/zeta(11) = 1/A013669. (End)
%e A079395 2^11 = 2048.
%p A079395 A079395:=n->ithprime(n)^11: seq(A079395(n), n=1..30); # _Wesley Ivan Hurt_, Feb 07 2017
%t A079395 Array[Prime[ # ]^11 &, 30] (* _Vladimir Joseph Stephan Orlovsky_, May 01 2008 *)
%t A079395 Prime[Range[20]]^11 (* _Vincenzo Librandi_, Mar 27 2014 *)
%o A079395 (PARI) forprime (p=2,100,print1(p^11","))
%o A079395 (Magma) [p^11: p in PrimesUpTo(300)]; // _Vincenzo Librandi_, Mar 27 2014
%Y A079395 Subsequence of A008455.
%Y A079395 Cf. A013669.
%K A079395 nonn,easy
%O A079395 1,1
%A A079395 _Jon Perry_, Jan 06 2003