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.

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

This page as a plain text file.
%I A180774 #5 Jun 02 2025 03:04:26
%S A180774 0,0,5,14,42,119,253,526,944,1702,2655,4510,6284,9867,13519,19980,
%T A180774 25128,37286,44562,63802,76850,102370,118591,168208,183320,241554,
%U A180774 279852,359754,387016,528861,543620,712450,780810,953120,1025355,1360255
%N A180774 Number of distinct solutions of sum{i=1..3}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1.
%C A180774 Column 3 of A180782
%H A180774 R. H. Hardin, <a href="/A180774/b180774.txt">Table of n, a(n) for n=1..447</a>
%e A180774 Solutions for sum of products of 3 1..3 pairs = 0 (mod 4) are
%e A180774 (1*1 + 1*1 + 1*2) (1*1 + 1*1 + 2*3) (1*1 + 1*2 + 3*3) (1*1 + 1*3 + 2*2)
%e A180774 (1*1 + 2*3 + 3*3) (1*2 + 1*2 + 2*2) (1*2 + 1*3 + 1*3) (1*2 + 2*2 + 2*3)
%e A180774 (1*2 + 3*3 + 3*3) (1*3 + 1*3 + 2*3) (1*3 + 2*2 + 3*3) (2*2 + 2*2 + 2*2)
%e A180774 (2*2 + 2*3 + 2*3) (2*3 + 3*3 + 3*3)
%K A180774 nonn
%O A180774 1,3
%A A180774 _R. H. Hardin_ Sep 20 2010