

A085886


Let r and s be such that r + s = n; a(n) = minimum value of phi(r) + phi(s).


0



2, 2, 2, 3, 3, 3, 3, 4, 4, 5, 4, 5, 5, 6, 6, 8, 6, 7, 7, 8, 8, 10, 8, 9, 9, 10, 10, 12, 10, 9, 9, 10, 10, 12, 10, 13, 12, 14, 12, 16, 12, 13, 13, 14, 14, 16, 14, 17, 16, 18, 16, 20, 16, 19, 18, 20, 20, 22, 16, 17, 17, 18, 18, 20, 18, 21, 20, 22, 20, 24, 20, 25, 22, 24, 24, 28, 22, 25
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

2,1


LINKS

Table of n, a(n) for n=2..79.


EXAMPLE

a(8) = 3, the partitions are ( 1,7),(2,6),(3,5),(4,4) which give 7, 3, 6,4 as the sum of phi functions of both the parts.


CROSSREFS

Cf. A085885.
Sequence in context: A285588 A072912 A025786 * A088676 A276797 A166872
Adjacent sequences: A085883 A085884 A085885 * A085887 A085888 A085889


KEYWORD

nonn


AUTHOR

Amarnath Murthy, Jul 08 2003


EXTENSIONS

More terms from David Wasserman, Feb 10 2005


STATUS

approved



