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.

A180798 Number of distinct solutions of sum{i=1..6}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1.

This page as a plain text file.
%I A180798 #6 Jun 02 2025 03:06:26
%S A180798 1,16,159,1336,7770,39768,158242,576277,1770957,5103172,13020114,
%T A180798 32106338,71312200,155419661,313496424,622375358,1154635735,
%U A180798 2140048203,3718742275,6493401148,10741764465,17813177343,28173574540,45107483725
%N A180798 Number of distinct solutions of sum{i=1..6}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1.
%C A180798 Column 6 of A180803
%H A180798 R. H. Hardin, <a href="/A180798/b180798.txt">Table of n, a(n) for n=1..183</a>
%e A180798 Solutions for sum of products of 6 0..1 pairs = 0 (mod 2) are
%e A180798 (0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*0) (0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*1)
%e A180798 (0*0 + 0*0 + 0*0 + 0*0 + 0*1 + 0*1) (0*0 + 0*0 + 0*0 + 0*0 + 1*1 + 1*1)
%e A180798 (0*0 + 0*0 + 0*0 + 0*1 + 0*1 + 0*1) (0*0 + 0*0 + 0*0 + 0*1 + 1*1 + 1*1)
%e A180798 (0*0 + 0*0 + 0*1 + 0*1 + 0*1 + 0*1) (0*0 + 0*0 + 0*1 + 0*1 + 1*1 + 1*1)
%e A180798 (0*0 + 0*0 + 1*1 + 1*1 + 1*1 + 1*1) (0*0 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1)
%e A180798 (0*0 + 0*1 + 0*1 + 0*1 + 1*1 + 1*1) (0*0 + 0*1 + 1*1 + 1*1 + 1*1 + 1*1)
%e A180798 (0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1) (0*1 + 0*1 + 0*1 + 0*1 + 1*1 + 1*1)
%e A180798 (0*1 + 0*1 + 1*1 + 1*1 + 1*1 + 1*1) (1*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1)
%K A180798 nonn
%O A180798 1,2
%A A180798 _R. H. Hardin_, suggested by _Max Alekseyev_ in the Sequence Fans Mailing List, Sep 20 2010