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.

A064232 a(n) = n^(n+2) mod (n+1)^(n+1).

This page as a plain text file.
%I A064232 #11 Dec 15 2020 16:43:52
%S A064232 0,1,16,243,971,31469,32530,6799175,298900846,1381059609,144064988167,
%T A064232 7774410799163,72418038179852,6737865711858693,426377776285933636,
%U A064232 6292404967145601295,586165173437961392811,2993987233372099394609
%N A064232 a(n) = n^(n+2) mod (n+1)^(n+1).
%H A064232 Harry J. Smith, <a href="/A064232/b064232.txt">Table of n, a(n) for n = 0..100</a>
%F A064232 a(n) = n^(n+2) mod (n+1)^(n+1).
%t A064232 Table[PowerMod[n,n+2,(n+1)^(n+1)],{n,0,20}] (* _Harvey P. Dale_, Dec 15 2020 *)
%o A064232 (PARI) { for (n=0, 100, write("b064232.txt", n, " ", n^(n + 2) % (n + 1)^(n + 1)) ) } \\ _Harry J. Smith_, Sep 10 2009
%K A064232 easy,nonn
%O A064232 0,3
%A A064232 _Floor van Lamoen_, Sep 22 2001