A077982 - OEIS

This site is supported by donations to The OEIS Foundation.

A077982

Min(P in Partitions(n), Sum(k in P, d(k))) where d(k) = number of divisors of k (A000005).

0, 1, 2, 2, 3, 2, 3, 2, 3, 3, 4, 2, 3, 2, 3, 4, 4, 2, 3, 2, 3, 4, 4, 2, 3, 3, 4, 4, 4, 2, 3, 2, 3, 4, 4, 4, 4, 2, 3, 4, 4, 2, 3, 2, 3, 4, 4, 2, 3, 3, 4, 4, 4, 2, 3, 4, 4, 4, 4, 2, 3, 2, 3, 4, 4, 4, 4, 2, 3, 4, 4, 2, 3, 2, 3, 4, 4, 4, 4, 2, 3, 4, 4, 2, 3, 4, 4, 4, 4, 2, 3, 4, 4, 4, 4, 4, 4, 2, 3, 4, 4, 2, 3, 2, 3 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,3`
	COMMENTS	`For sufficiently large n, it is known that n is the sum of three primes, implying a(n) <= 6.` `Goldbach's conjecture implies a(n) <= 4 for n even and a(n) <= 5 for n odd.`
	REFERENCES	`Suggested by Amarnath Murthy.`
	LINKS	`Index entries for two-way infinite sequences`
	CROSSREFS	`Cf. A084344, A000005.` `Sequence in context: A162361 A171135 A073855 * A185816 A099427 A059964` `Adjacent sequences: A077979 A077980 A077981 * A077983 A077984 A077985`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson, Jun 21 2003`

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

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.