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.

A233011 Primes of the form (2*n)! - n!^2 - 1.

Original entry on oeis.org

19, 683, 478483199, 20921164185599
Offset: 1

Views

Author

K. D. Bajpai, Dec 03 2013

Keywords

Comments

The 5th term a(5) has 268 digits and is too long to display in data section.
The 7th term a(7) in the sequence has 823 digits.
a(8) has 2030 digits; a(9) has 2264 digits (these are not included in b-file).

Examples

			a(1)= 19: n= 2: (2*n)!- n!^2-1= 19 which is prime.
a(2)= 683: n= 3: (2*n)!- n!^2-1= 683 which is prime.
		

Crossrefs

Cf. A055490 (primes: n! -1).
Cf. A118812 (primes: (2*n)!-n!+1).

Programs

  • Maple
    KD := proc() local a; a:=(2*n)!-n!^2-1; if isprime(a) then RETURN (a);  fi; end: seq(KD(), n=1..200);