|
Search: id:A085887
|
|
|
| A085887 |
|
Let r and s be such that r + s = n; a(n) = minimum value of tau(r) + tau(s). |
|
+0
1
|
|
| 2, 3, 3, 4, 3, 4, 3, 4, 4, 5, 3, 4, 3, 4, 4, 5, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 6, 3, 4, 3, 4, 4, 5, 4, 6, 3, 4, 4, 5, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 6, 3, 4, 4, 5, 4, 5, 3, 4, 3, 4, 4, 5, 4, 6, 3, 4, 4, 5, 3, 4, 3, 4, 4, 5, 4, 6, 3, 4, 4, 5, 3, 4, 4, 5, 4, 6, 3, 4, 4, 5, 4, 5, 4, 6, 3, 4, 4, 5, 3, 4, 3, 4, 4
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
a(p+1) = 3 if p is a prime. a(n) = 4 if n is the sum of two primes. For all even numbers > 4, a(n) = 4 by Goldbakh's conjecture.
|
|
EXAMPLE
|
a(8) = 3, the partitions are ( 1,7),(2,6),(3,5),(4,4) which give 3,6,4 and 6 as the sum of divisors of both the parts.
|
|
CROSSREFS
|
Cf. A085883.
Sequence in context: A077567 A096344 A030349 this_sequence A049108 A086925 A088858
Adjacent sequences: A085884 A085885 A085886 this_sequence A085888 A085889 A085890
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 08 2003
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Feb 10 2005
|
|
|
Search completed in 0.002 seconds
|
