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.

A286813 Number of positive odd solutions to equation x^2 + 8*y^2 = 8*n + 9.

This page as a plain text file.
%I A286813 #90 Jun 21 2021 01:17:56
%S A286813 1,1,0,1,0,0,1,0,1,1,1,1,0,0,1,1,0,0,1,0,0,1,0,1,1,1,0,1,1,1,1,0,0,0,
%T A286813 1,0,2,0,0,1,0,0,0,0,1,2,0,0,1,1,0,1,1,1,1,1,0,0,1,0,1,0,0,2,0,0,1,0,
%U A286813 0,2,0,0,0,0,1,0,1,0,1,1,1,1,0,1,1,0,2,0
%N A286813 Number of positive odd solutions to equation x^2 + 8*y^2 = 8*n + 9.
%H A286813 Seiichi Manyama, <a href="/A286813/b286813.txt">Table of n, a(n) for n = 0..10000</a>
%H A286813 Simon Plouffe, <a href="http://vixra.org/abs/1409.0048"> Conjectures of the OEIS, as of June 20, 2018.</a>
%F A286813 Expansion of q^(-9/8) * (eta(q^2) * eta(q^16))^2 / (eta(q) * eta(q^8)) in powers of q.
%F A286813 Euler Transform of -(-2*x^8-x^7-1)/(x^9+x^8+x+1) (o.g.f.). - _Simon Plouffe_, Jun 23 2018
%Y A286813 Related to the number of positive odd solutions to equation x^2 + k*y^2 = 8*n + k + 1: A008441 (k=1), A033761 (k=2), A033762 (k=3), A053692 (k=4), A033764 (k=5), A259896 (k=6), A035162 (k=7), this sequence (k=8).
%K A286813 nonn
%O A286813 0,37
%A A286813 _Seiichi Manyama_, May 28 2017