For a=2, b=c=21 and n≥3 the inequality is not satisfied. On the other hand, for n=1 it is equivalent to the AM-GM inequality. It remains to consider the case n=2.
We shall prove that the inequality is true for n=2.
First solution. Set x=bc. Then
abc(a2+b2+c2)=ax(a2+(b+c)2−2x).
The function x(p−2x) is increasing for x≤4p. Since
bc≤4(b+c)2≤4a2+(b+c)2,
it follows that if b+c=b′+c′ and bc≤b′c′, then
abc(a2+b2+c2)≤ab′c′(a2+b′2+c′2).
Without loss of generality we can assume that b≤1≤c. Set b′=1,c′=b+c−1. Since b+c=b′+c′ and bc−b′c′=(b−1)(c−1)≤0, the above implies that
abc(a2+b2+c2)≤a(2−a)(a2+1+(2−a)2).
Set d=(a−1)2. Then
a(2−a)(a2+1+(2−a)2)=(1−d)(3+2d)=3−d−2d2≤3
and the given inequality (for n=2) follows.
Second solution. Let n=2 and set ab+bc+ac=x. Then we have a2+b2+c2=9−2x and 9abc≤x2 (this follows from the inequality (ab+bc+ac)2≥3abc(a+b+c)). Hence we have to prove that (9−2x)x2≤27, which is equivalent to the obvious (2x+3)(x−3)2≥0.