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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A254269 Largest prime factor of the strict partition numbers Q(n) (partitions into distinct parts, A000009). 1
 1, 1, 1, 2, 2, 3, 2, 5, 3, 2, 5, 3, 5, 3, 11, 3, 2, 19, 23, 3, 2, 19, 89, 13, 61, 71, 11, 3, 37, 2, 37, 17, 13, 7, 2, 13, 167, 19, 3, 491, 53, 7, 31, 23, 227, 2, 3, 37, 97, 17, 59, 241, 79, 5, 953, 1063, 1777, 29, 367, 17, 17, 3019, 181, 29, 4111 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS A035359 is the sequence of indices n such that a(n) = A000009(n). LINKS Jean-François Alcover and Giovanni Resta, Table of n, a(n) for n = 0..10000 (first 1001 terms from Jean-François Alcover) Eric Weisstein's MathWorld, Partition Function Q MATHEMATICA Table[FactorInteger[PartitionsQ[n]][[-1, 1]], {n, 0, 100}] CROSSREFS Cf. A000009, A035359, A071963. Sequence in context: A076396 A370834 A076397 * A264662 A076403 A157987 Adjacent sequences: A254266 A254267 A254268 * A254270 A254271 A254272 KEYWORD nonn AUTHOR Jean-François Alcover, Jan 27 2015 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.

Last modified September 8 17:50 EDT 2024. Contains 375753 sequences. (Running on oeis4.)