id:A060745 - OEIS Search Results

Search: id:A060745

Displaying 1-1 of 1 results found.

page 1

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

1, 7, 33, 40, 109, 124, 314, 659, 815, 964, 2499, 4351, 5780 (list; graph; listen)

	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: A050148 A024093 A110323 this_sequence A051895 A131211 A100855` `Adjacent sequences: A060742 A060743 A060744 this_sequence A060746 A060747 A060748`
	KEYWORD	`nonn`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 23 2001`

page 1

Search completed in 0.002 seconds

Last modified December 2 15:58 EST 2008. Contains 150992 sequences.