login
This site is supported by donations 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 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

MATHEMATICA

a = 0; Do[ d = GCD[ PartitionsP[ n ], PartitionsQ[ n ]]; If[ d > a, a = d; Print[ n ]], {n, 1, 11050} ]

CROSSREFS

Sequence in context: A110323 A175189 A153286 * A051895 A168574 A131211

Adjacent sequences:  A060742 A060743 A060744 * A060746 A060747 A060748

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 23 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 19:20 EST 2012. Contains 205945 sequences.