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.

A062411 a(n) = (-1)^(p-1)*(p-1)! + 1 where p = prime(n).

This page as a plain text file.
%I A062411 #11 Jul 04 2021 08:42:59
%S A062411 0,3,25,721,3628801,479001601,20922789888001,6402373705728001,
%T A062411 1124000727777607680001,304888344611713860501504000001,
%U A062411 265252859812191058636308480000001
%N A062411 a(n) = (-1)^(p-1)*(p-1)! + 1 where p = prime(n).
%C A062411 Apart from the first term, the same as A060371. - _R. J. Mathar_, Oct 02 2008
%D A062411 D. M. Burton, Elementary Number Theory, Allyn and Bacon, Inc. Boston, MA, 1976, p. 164.
%o A062411 (PARI) for(n=1,13,print((-1)^(prime(n)-1)*(prime(n)-1)!+1))
%K A062411 easy,nonn
%O A062411 1,2
%A A062411 _Jason Earls_, Jul 09 2001