id:A060718 - OEIS Search Results

Search: id:A060718

Displaying 1-1 of 1 results found.

page 1

The least k such that GCD( p(k), q(k) ) is n, where p() is the unrestricted partition function (A000041) and q is the distinct partition function (A000009).

+0
1

1, 8, 26, 11, 7, 46, 33, 94, 277, 130, 85, 180, 173, 47, 434, 131, 60, 297, 1175, 569, 40, 305, 1243, 142, 1024, 213, 169, 775, 988, 900, 1622, 262, 470, 844, 812, 2391 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Duplicate of A060743. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 02 2009]`
	CROSSREFS	`Sequence in context: A069586 A042189 A004246 this_sequence A060743 A029617 A120743` `Adjacent sequences: A060715 A060716 A060717 this_sequence A060719 A060720 A060721`
	KEYWORD	`nonn`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 23 2001`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research