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-3 of 3 results.

A103855 a(n) = prime(n)! - prime(n)# + 1.

Original entry on oeis.org

1, 1, 91, 4831, 39914491, 6226990771, 355687427585491, 121645100399132311, 25852016738884753547131, 8841761993739701954537146306771, 8222838654177922817725362319509871, 13763753091226345046315979581573481661865191, 33452526613163807108170062053440751360901736472791
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 20 2005

Keywords

Crossrefs

Programs

  • Mathematica
    primorial[n_] := Product[Prime[i], {i, n}]; A103855[n_] := Prime[n]! - primorial[n] + 1; Array[A103855, 20] (* G. C. Greubel, May 09 2017 *)
    With[{nn=15},#[[1]]-#[[2]]+1&/@Thread[{Prime[Range[nn]]!,FoldList[Times,Prime[Range[nn]]]}]] (* Harvey P. Dale, Aug 11 2025 *)

Formula

a(n) = A039716(n) - A002110(n) + 1 = A002110(n) * (A092435(n) - 1) + 1.

A103859 Number of divisors of prime(n)! - prime(n)# + 1.

Original entry on oeis.org

1, 1, 4, 2, 4, 4, 4, 4, 16, 4, 8, 16, 16, 32, 32, 8, 32, 8, 16, 64, 32, 16, 32, 64, 512, 2, 16
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 20 2005

Keywords

Crossrefs

Programs

  • PARI
    a(n) = numdiv(prime(n)! - prod(k=1, n, prime(k)) + 1); \\ Michel Marcus, Nov 06 2022

Formula

a(n) = A000005(A103855(n)).

Extensions

a(27) from Jinyuan Wang, Jun 19 2025

A103895 Sum of divisors of prime(n)! / prime(n)# + 1.

Original entry on oeis.org

3, 3, 6, 31, 18864, 258624, 733755680, 13213440000, 115884221549652, 1372805558801047105280, 40999368670243322750932, 1855053929165456908669711085568, 113895178720398409713058206857404800, 4701294182073054820056713442085236768
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 20 2005

Keywords

Crossrefs

Formula

a(n) = A000203(A103890(n)).
Showing 1-3 of 3 results.