login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111353 Number of distinct prime factors of P(6*n+1) where P(m) is the partition number. 0
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = A087175(6n+1). - R. J. Mathar, Aug 25 2011
EXAMPLE
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.
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 *)
CROSSREFS
Sequence in context: A271373 A307558 A226273 * A038565 A344869 A248605
KEYWORD
nonn
AUTHOR
Parthasarathy Nambi, Nov 05 2005
EXTENSIONS
More terms from Stefan Steinerberger, Feb 17 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)