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 A167657 #20 Sep 08 2022 08:45:48 %S A167657 0,1,4,9,256,25,1296,49,4096,531441,100,1771561,20736,169,38416, %T A167657 11390625,16777216,289,34012224,130321,400,85766121,234256,148035889, %U A167657 110075314176,390625,676,531441,784,707281,478296900000000000000,923521 %N A167657 Product of n-th block of identical consecutive values of A000720. %H A167657 Jason Kimberley, <a href="/A167657/b167657.txt">Table of n, a(n) for n = 1..10000</a> %F A167657 a(n) = n^(A000040(n+1)-A000040(n)). - _Jason Kimberley_, May 27 2018 %p A167657 A000720 := proc(n) numtheory[pi](n) ; end proc: A167657 := proc(nmax) local ol,a ; ol := 0 ; a := 0 ; for n from 1 to nmax do if A000720(n) = ol then a := a*ol ; else printf("%d,",a) ; a := A000720(n) ; end if; ol := A000720(n) ; end do ; return ; end proc: A167657(160) ; # _R. J. Mathar_, Jan 30 2010 %t A167657 Most@ Map[Times @@ # &, Split@ Array[PrimePi, 132]] (* _Michael De Vlieger_, May 27 2018 *) %o A167657 (Magma) A40:=NthPrime; %o A167657 A167657:=func<n|(n-1)^(A40(n)-A40(n-1))>; %o A167657 [A167657(n):n in[1..32]]; // _Jason Kimberley_, May 27 2018 %Y A167657 Cf. A000720. %K A167657 nonn,look %O A167657 1,3 %A A167657 _Giovanni Teofilatto_, Nov 08 2009 %E A167657 a(1) = 0 and a(5) = 256 corrected by _Giovanni Teofilatto_, Nov 12 2009 %E A167657 a(17) inserted and a(20) corrected by _R. J. Mathar_, Jan 30 2010 %E A167657 Name edited by _Jason Kimberley_, Jul 01 2018