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-4 of 4 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.

A103858 Number of distinct prime factors of prime(n)! - prime(n)# + 1.

Original entry on oeis.org

0, 0, 2, 1, 2, 2, 2, 2, 4, 2, 3, 4, 4, 5, 5, 3, 5, 3, 4, 6, 5, 4, 5, 6, 9, 1, 4
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 20 2005

Keywords

Comments

a(27) >= 4. - Amiram Eldar, Jan 21 2024

Crossrefs

Programs

  • Mathematica
    primorial[n_] := Product[Prime[i], {i, n}]; A103855[n_] := Prime[n]! - primorial[n] + 1;  PrimeNu[Array[A103855, 20]] (* G. C. Greubel, May 09 2017 *)
  • PARI
    a(n) = omega(prime(n)! - prod(k=1, n, prime(k)) + 1); \\ Michel Marcus, Nov 06 2022

Formula

a(n) = A001221(A103855(n)).

Extensions

a(27) from Jinyuan Wang, Jun 19 2025

A103860 Sum of divisors of prime(n)! - prime(n)# + 1.

Original entry on oeis.org

1, 1, 112, 4832, 39929032, 6227388000, 355687500698712, 121674349040732800, 26204303786955547121568, 8844022735747817449795273936944, 8243360285859647409507002537385024, 13989390090648918627329493090109449081402880, 33452526614068666040537953433982904696696861440000
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 20 2005

Keywords

Crossrefs

Programs

  • Mathematica
    Module[{nn=15,pr,pm},pr=Prime[Range[nn]]!;pm=FoldList[Times,Prime[Range[nn]]];DivisorSigma[1,#[[1]]-#[[2]]+1&/@Thread[{pr,pm}]]] (* Harvey P. Dale, Dec 18 2022 *)
  • PARI
    a(n) = sigma(prime(n)! - factorback(primes(n)) + 1); \\ Jinyuan Wang, Dec 28 2024

Formula

a(n) = A000203(A103855(n)).

A103894 Number of divisors of prime(n)! / prime(n)# + 1.

Original entry on oeis.org

2, 2, 2, 3, 4, 8, 8, 16, 4, 8, 4, 16, 16, 32, 8, 4, 8, 16, 64, 32, 32, 32, 32, 64, 32, 16, 32, 8, 128, 32
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 20 2005

Keywords

Crossrefs

Formula

a(n) = A000005(A103890(n)).

Extensions

a(28)-a(30) from Amiram Eldar, Feb 13 2020
Showing 1-4 of 4 results.