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.

A111353 Number of distinct prime factors of P(6*n+1) where P(m) is the partition number.

Original entry on oeis.org

2, 1, 3, 3, 3, 3, 3, 3, 4, 5, 2, 3, 4, 2, 3, 7, 4, 5, 5, 2, 4, 4, 3, 5, 3, 1, 4, 3, 3, 2, 4, 5, 3, 3, 5, 3, 6, 4, 2, 2, 3, 4, 5, 4, 4, 3, 4, 4, 4, 3, 5, 3, 5, 5, 6, 3, 4, 4, 3, 3, 3, 5, 6, 3, 4, 6, 4, 4, 4, 4, 4, 3, 6, 7, 3, 4, 4, 7, 2, 8
Offset: 1

Views

Author

Parthasarathy Nambi, Nov 05 2005

Keywords

Examples

			If n=1 then the number of distinct prime factors of P(6*n+1) = P(7) is 2, which is the first term in the sequence.
		

Programs

  • Mathematica
    Table[Length[FactorInteger[PartitionsP[6n + 1]]], {n, 1, 80}] (* Stefan Steinerberger, Feb 17 2006 *)
    PrimeNu[PartitionsP[6*Range[80]+1]] (* Harvey P. Dale, Mar 31 2019 *)

Formula

a(n) = A087175(6n+1). - R. J. Mathar, Aug 25 2011

Extensions

More terms from Stefan Steinerberger, Feb 17 2006