

A075790


If n can be written in the form r^is^j (see A074981), where r,s,i,j are integers with r>0, s>0, i>1, j>1 choose the representation with smallest r^i (in case of ties, minimize i and j); or if n is not of this form set r=s=i=j=0; sequence gives values of s.


1



2, 5, 1, 2, 2, 0, 1, 1, 4, 3, 4, 2, 6, 0, 1, 3, 2, 3, 2, 4, 2, 3, 2, 1, 10, 1, 3, 2, 14, 19, 1, 2, 4, 0, 1, 8, 3, 11, 5, 3, 2, 0, 21, 9, 2, 3, 9, 1, 2, 0, 7, 12, 26, 3, 3, 2, 8, 0, 29, 2, 8, 0, 1, 6, 4, 0, 33, 2, 10, 0, 5, 3, 2, 13, 5, 7, 2, 0, 7, 1, 12, 0, 41, 4, 6, 0, 13, 9, 2, 0, 3, 2, 2, 3, 7, 2, 2, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)




