id:A077982 - OEIS Search Results

Search: id:A077982

Displaying 1-1 of 1 results found.

page 1

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

+0
3

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; listen)

	OFFSET	`0,3`
	COMMENT	`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: A049237 A162361 A073855 this_sequence A099427 A059964 A087458` `Adjacent sequences: A077979 A077980 A077981 this_sequence A077983 A077984 A077985`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson, Jun 21 2003`

page 1

Search completed in 0.002 seconds

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.

AT&T Labs Research