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.

A103890 a(n) = prime(n)! / prime(n)# + 1.

Original entry on oeis.org

2, 2, 5, 25, 17281, 207361, 696729601, 12541132801, 115880067072001, 1366643159020339200001, 40999294770610176000001, 1854768736099424576471040000001, 109950690675973888893203251200000001, 4617929008390903333514536550400000001
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 20 2005

Keywords

Crossrefs

Programs

  • Mathematica
    #[[1]]/#[[2]]&/@With[{nn=15},Thread[{Prime[Range[nn]]!,FoldList[ Times,Prime[ Range[nn]]]}]]+1 (* Harvey P. Dale, May 21 2019 *)
  • PARI
    a(n) = prime(n)!/vecprod(primes(n)) + 1; \\ Michel Marcus, Nov 12 2023

Formula

a(n) = A039716(n)/A002110(n) + 1 = A092435(n) + 1.

A103856 Smallest prime factor of prime(n)! - prime(n)# + 1.

Original entry on oeis.org

1, 1, 7, 4831, 3673, 16349, 5240507, 4159, 83, 3911, 401, 61, 66935021479, 199, 73, 152249, 379, 5014363, 181, 191, 277, 155893, 35851, 431, 1499
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 20 2005

Keywords

Comments

a(26) has 160 digits and is too large to be included here.

Crossrefs

Programs

  • PARI
    a(n) = if(n>2, factor(prime(n)!-factorback(primes(n))+1)[1, 1], 1); \\ Jinyuan Wang, Dec 30 2024

Formula

a(n) = A020639(A103855(n)).

A103892 Greatest prime factor of prime(n)! / prime(n)# + 1.

Original entry on oeis.org

2, 2, 5, 5, 1571, 2693, 15427, 27749, 4154449757, 151585363459003, 73899633146196133, 24770877398207, 1429176066859677377, 7748318379505746557, 21662673895172922098651, 447620901583917369406703727865417431168683, 26823894708473887265117477378744683922119
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 20 2005

Keywords

Crossrefs

Formula

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