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!)
A060745 When gcd( p(n), q(n) ) increases, where p() is the unrestricted partition function (A000041) and q is the distinct partition function (A000009). 0
1, 7, 33, 40, 109, 124, 314, 659, 815, 964, 2499, 4351, 5780, 49518, 64816, 148408, 773599 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
a = 0; Do[ d = GCD[ PartitionsP[ n ], PartitionsQ[ n ]]; If[ d > a, a = d; Print[ n ]], {n, 1, 11050} ]
CROSSREFS
Sequence in context: A324412 A175189 A153286 * A275163 A051895 A168574
KEYWORD
nonn,more
AUTHOR
Robert G. Wilson v, Apr 23 2001
EXTENSIONS
a(14)-a(17) from Sean A. Irvine, Dec 25 2022
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 25 09:56 EDT 2024. Contains 371967 sequences. (Running on oeis4.)