login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..13.

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

Adjacent sequences:  A060742 A060743 A060744 * A060746 A060747 A060748

KEYWORD

nonn

AUTHOR

Robert G. Wilson v, Apr 23 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 4 21:32 EDT 2021. Contains 346455 sequences. (Running on oeis4.)