

A085304


Least number of 4th powers required to represent n!.


0



1, 1, 2, 6, 9, 10, 15, 15, 9, 10, 15, 6, 12, 12
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


LINKS



FORMULA

"Shortest" solutions to n!=Sum[x(j)^4], j=1, .., m[n] with minimal value of m[n]: a(n)=Min{m[n]}. Per analogiam A084355.


EXAMPLE

n=6: 6!=720=625+81+14,lengthofsolution=16>=a(6)
but 6!=720=2.256+13.16 seems shortest solution a(6)=15
n=7: 7!=5040=3.1296+4.256+8.16 so a(7)<=15 (uncertain);
n=8: a(8)<=9 because 8!=4.10000+1.256+4.16.


CROSSREFS



KEYWORD

more,nonn


AUTHOR



EXTENSIONS



STATUS

approved



