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.

A035594 Number of partitions of 2n with equal number of parts congruent to each of 1 and 3 (mod 4).

This page as a plain text file.
%I A035594 #9 Oct 13 2022 11:19:14
%S A035594 1,1,3,4,10,13,28,37,72,96,172,230,391,522,846,1129,1766,2348,3564,
%T A035594 4722,6992,9226,13371,17568,25006,32708,45817,59668,82430,106874,
%U A035594 145830,188260,254072,326608,436434,558725,739966,943512,1239434,1574254,2052699,2597422
%N A035594 Number of partitions of 2n with equal number of parts congruent to each of 1 and 3 (mod 4).
%F A035594 a(n) = A035544(2n).
%Y A035594 Cf. A035544.
%K A035594 nonn
%O A035594 0,3
%A A035594 _Olivier Gérard_
%E A035594 More terms from _Fabian Rothelius_, Feb 06 2001
%E A035594 More terms from _Alois P. Heinz_, Oct 13 2022