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.

A190076 Number of arrangements of 7 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 A190076 #7 Jul 22 2025 12:01:16
%S A190076 40,1896,28656,191456,834717,2783714,7737762,18951546,41786130,
%T A190076 84902980,162378720,292892946,503182507,835582280,1339061119,
%U A190076 2077237619,3144963614,4653920446,6746522401,9597835033,13398597773,18439060711
%N A190076 Number of arrangements of 7 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 A190076 Row 6 of A190071
%H A190076 R. H. Hardin, <a href="/A190076/b190076.txt">Table of n, a(n) for n = 1..126</a>
%e A190076 Some solutions for n=4
%e A190076 ..2...-3...-4....4...-1...-4....4...-1...-4...-3....2...-3....4...-3...-2....4
%e A190076 .-1....1....1...-2...-3...-4...-2...-3...-2...-1...-3...-1...-4...-2...-1...-2
%e A190076 .-4....2....3...-3....2...-2...-3....2...-2...-4....4....4...-3....3...-4....3
%e A190076 ..4....1....3....4....1....1....4....3....4...-4....1...-2....2....3....1...-4
%e A190076 ..4...-2...-4...-4...-1...-2....3...-4...-1....1...-1...-2....1....3....1...-2
%e A190076 .-4...-1...-2...-3....3....1...-2....4...-2...-2....2....3....4...-3...-1...-1
%e A190076 .-2....1...-3...-4....3....1...-1....2...-3....4...-2....4...-4....2...-4....3
%K A190076 nonn
%O A190076 1,1
%A A190076 _R. H. Hardin_ May 04 2011