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.

Showing 1-2 of 2 results.

A127230 a(n) = (2n)! - 1.

Original entry on oeis.org

1, 23, 719, 40319, 3628799, 479001599, 87178291199, 20922789887999, 6402373705727999, 2432902008176639999, 1124000727777607679999, 620448401733239439359999, 403291461126605635583999999, 304888344611713860501503999999, 265252859812191058636308479999999
Offset: 1

Views

Author

Artur Jasinski, Jan 09 2007

Keywords

Crossrefs

Programs

  • Mathematica
    Table[(2n)! - 1, {n, 1, 30}]

Formula

a(n) = -1 + A010050(n).

Extensions

Entry revised by Alois P. Heinz, Mar 27 2021

A067241 Numbers k such that gcd((2*k)!+1, k!+1) > 1.

Original entry on oeis.org

3, 5, 8, 9, 21, 23, 33, 39, 51, 63, 65, 81, 89, 95, 99, 113, 131, 173, 183, 191, 209, 215, 221, 239, 245, 251, 261, 281, 285, 299, 303, 309, 315, 341, 345, 363, 369, 371, 393, 411, 419, 431, 443, 473, 495, 509, 525, 543, 545, 561, 575, 593, 645, 659, 683, 711
Offset: 1

Views

Author

Benoit Cloitre, Feb 20 2002

Keywords

Crossrefs

Programs

  • Mathematica
    q[k_] := !CoprimeQ[(2*k)!+1, k!+1]; Select[Range[720], q] (* Amiram Eldar, May 01 2025 *)
  • PARI
    isok(k) = gcd((2*k)!+1, k!+1) > 1; \\ Amiram Eldar, May 01 2025
Showing 1-2 of 2 results.