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!)
A254269 Largest prime factor of the strict partition numbers Q(n) (partitions into distinct parts, A000009). 1

%I #16 Jun 06 2015 05:13:28

%S 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,

%T 2,37,17,13,7,2,13,167,19,3,491,53,7,31,23,227,2,3,37,97,17,59,241,79,

%U 5,953,1063,1777,29,367,17,17,3019,181,29,4111

%N Largest prime factor of the strict partition numbers Q(n) (partitions into distinct parts, A000009).

%C A035359 is the sequence of indices n such that a(n) = A000009(n).

%H Jean-François Alcover and Giovanni Resta, <a href="/A254269/b254269.txt">Table of n, a(n) for n = 0..10000</a> (first 1001 terms from Jean-François Alcover)

%H Eric Weisstein's MathWorld, <a href="http://mathworld.wolfram.com/PartitionFunctionQ.html">Partition Function Q</a>

%t Table[FactorInteger[PartitionsQ[n]][[-1, 1]], {n, 0, 100}]

%Y Cf. A000009, A035359, A071963.

%K nonn

%O 0,4

%A _Jean-François Alcover_, Jan 27 2015

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 August 27 11:50 EDT 2024. Contains 375468 sequences. (Running on oeis4.)