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.

A194262 Largest prime that divides the n-th partition number p(n) but does not divide p(1)*p(2)*...*p(n-1), or 1 if none.

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 1, 1, 1, 1, 1, 1, 101, 1, 1, 1, 1, 1, 1, 19, 1, 167, 251, 1, 89, 29, 43, 13, 83, 467, 311, 23, 1, 1231, 41, 17977, 281, 1, 1, 127, 193, 2417, 71, 97, 1087, 241, 67, 7013, 631, 9283, 661, 53, 5237, 59, 227, 1019, 102359, 3251, 199, 409, 971
Offset: 1

Views

Author

Jonathan Sondow, Aug 21 2011

Keywords

Comments

It appears that a(n) is prime for all n > 97. See A194259 and A194260 for additional comments and links.

Crossrefs

Programs

  • Maple
    with(combinat): with(numtheory):
    b:= proc(n) option remember;
          `if`(n=1, {}, b(n-1) union factorset(numbpart(n)))
        end:
    a:= n-> `if`(n=1, 1, max(1, (b(n) minus b(n-1))[])):
    seq(a(n), n=1..120);  # Alois P. Heinz, Aug 21 2011
  • Mathematica
    a[n_] := Complement[FactorInteger[PartitionsP[n]][[All, 1]], FactorInteger[Product[PartitionsP[k], {k, 1, n-1}]][[All, 1]]] /. {} -> {1} // Last; Table[a[n], {n, 1, 100}] (* Jean-François Alcover, Jan 28 2014 *)