[seqfan] i. or ii.

[юрий герасимов]

Dear SeqFans,                                                                                                                                               
i.  Number of proper nondivisor pairs { n mod m and m } of n where (n mod m) < m:             
0, 0, 0, 0, 1, 0, 2, 1, 2, 2, 6, 1, 6, 5, 4, 4, 10, 5, 12, 6, 8, 11, 18, 5, 18, 14, 14, 11, ...                            
ii.  Numbers k >= 0 such that 2^k is the total number of distinct squarefree numbers          
 in all ways to write n as a product of 2 squarefree numbers, or -1 if no such k exists:                    
0, 1, 1, 0, 1, 2, 1, -1, 0, 2, 1, 1, 1, 2, 2, -1, 1, 1, 1, 1, 2, 2, 1, -1, 0, 2, -1, 1, 1, 3, 1, -1, 2, 2, 2, 0, 
1, 2, 2, -1, 1, 3, 1, 1, 1, 2, 1, -1, 0, 1, 2, 1, 1, -1, 2, -1, 2, 2, 1, 2, 1, 2, 1, -1, 2, 3, 1, 1, 2, 3, 1, -1, ...
This sequences ( i. or ii. ) is of general interest, and is suitable for OEIS ?                                    
Best recards. JSG