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.

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

This page as a plain text file.
%I A180792 #5 Jun 02 2025 03:05:57
%S A180792 0,0,26,744,18475,326446,4292149,43506488,354466019,2391684440,
%T A180792 13770292256,69044240450,307750080388,1235903232638,4537248102720,
%U A180792 15362780912768,48489022864600,143504551536641,401488209735955
%N A180792 Number of distinct solutions of sum{i=1..10}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 1..n-1.
%C A180792 Column 10 of A180793
%H A180792 R. H. Hardin, <a href="/A180792/b180792.txt">Table of n, a(n) for n=1..183</a>
%K A180792 nonn
%O A180792 1,3
%A A180792 _R. H. Hardin_ Sep 20 2010