cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A190077 Number of arrangements of 8 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.

This page as a plain text file.
%I A190077 #7 Jul 22 2025 12:01:24
%S A190077 0,7584,162028,1436962,7843113,31391655,101530262,282859251,698197690,
%T A190077 1570715217,3291688243,6460935664,12000071771,21412481203,36702670681,
%U A190077 60642753250,97406905547,152416471950,232926480058,348492673798
%N A190077 Number of arrangements of 8 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 A190077 Row 7 of A190071
%H A190077 R. H. Hardin, <a href="/A190077/b190077.txt">Table of n, a(n) for n = 1..81</a>
%e A190077 Some solutions for n=4
%e A190077 .-4...-3...-4...-2...-3...-2...-1...-4...-4...-1...-4...-2...-4...-4...-3...-2
%e A190077 .-3...-4...-4...-4...-4...-4...-4...-4...-3...-4...-4...-4...-3...-4...-4...-4
%e A190077 .-1...-4....4....3....3....3...-1....2....1....3....4....4...-3...-4...-2...-2
%e A190077 ..1....2...-4...-2...-2...-3....1...-2...-2....3....2....4....1....1....3....1
%e A190077 ..4...-4....2...-3...-1...-2....3....4...-2....3...-1....4....2...-3....3...-2
%e A190077 .-2...-2....3....1...-1....2...-1...-3....2....2...-1...-3...-3...-1...-1....3
%e A190077 ..1....3....1....4...-4...-4...-4...-3...-2...-2...-3....3....4....3...-1....2
%e A190077 ..2...-3...-2....1....3...-4....3...-1...-1....2....2....4....4....4....1...-2
%K A190077 nonn
%O A190077 1,2
%A A190077 _R. H. Hardin_ May 04 2011