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.

A103857 Greatest prime factor of prime(n)! - prime(n)# + 1.

Original entry on oeis.org

1, 1, 13, 4831, 10867, 380879, 67872713, 29248641596329, 5375659901, 2260742008115495258127626261, 39302553278734052383226897, 2202226772995090243, 363934772650919, 125129894757902719183, 1330939456978870860802004244587
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 20 2005

Keywords

Crossrefs

Formula

a(n) = A006530(A103855(n)).

A103891 Smallest prime factor of prime(n)! / prime(n)# + 1.

Original entry on oeis.org

2, 2, 5, 5, 11, 7, 19, 31, 27893, 223, 554797, 10333, 29, 61, 28652131, 293049347, 7731517, 1483, 73, 337809273983, 67, 440939, 1321, 94099, 89, 107, 281, 1908113757161297657, 479, 61, 167, 3121, 177907, 5039, 11519, 281, 612153149, 587, 2753, 21491, 2897, 97, 307
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 20 2005

Keywords

Crossrefs

Formula

a(n) = A020639(A103890(n)).

Extensions

a(28)-a(30) from Amiram Eldar, Feb 13 2020
More terms from Jinyuan Wang, Apr 16 2020
Showing 1-3 of 3 results.