cp's OEIS Frontend

A190075 Number of arrangements of 6 nonzero numbers x(i) in -n..n with the sum of div(x(i),x(i+1)), where div(a,b)=a/b produces the integer quotient implying a nonnegative remainder, equal to zero.

%I A190075 #7 Jul 22 2025 12:01:09
%S A190075 0,550,5136,25306,88509,249119,599181,1291797,2542771,4665542,8142317,
%T A190075 13502963,21463807,33185295,49745019,72458535,103375585,144707600,
%U A190075 199040665,269251217,358360590,471257436,613624162,789275327,1002980959
%N A190075 Number of arrangements of 6 nonzero numbers x(i) in -n..n with the sum of div(x(i),x(i+1)), where div(a,b)=a/b produces the integer quotient implying a nonnegative remainder, equal to zero.
%C A190075 Row 5 of A190071
%H A190075 R. H. Hardin, <a href="/A190075/b190075.txt">Table of n, a(n) for n = 1..200</a>
%e A190075 Some solutions for n=4
%e A190075 ..4....2....3....2....2...-2...-3...-2....4....2...-3....3...-4...-2....1....1
%e A190075 .-2...-1...-4...-2....3...-4....3....3....4....2...-4....2....4....1...-3...-2
%e A190075 .-3....4....2....4....2....3....1...-1....3...-2....4....2....2...-1....2...-4
%e A190075 ..4....3....2...-4....3...-2....2...-1....2....1...-2....3....2....2....1...-4
%e A190075 ..4...-4...-3....4...-4...-2...-2...-2...-1...-4...-2....4...-4....4...-1....2
%e A190075 ..4...-3...-3....1....4...-3....2...-1....3...-2...-2...-2....2....1...-2....3
%K A190075 nonn
%O A190075 1,2
%A A190075 _R. H. Hardin_ May 04 2011