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.

A078407 Number of ways to partition 4*n+2 into distinct positive integers.

This page as a plain text file.
%I A078407 #6 Oct 19 2017 03:14:08
%S A078407 1,4,10,22,46,89,165,296,512,864,1426,2304,3658,5718,8808,13394,20132,
%T A078407 29927,44046,64234,92864,133184,189586,267968,376256,525016,728260,
%U A078407 1004544,1378304,1881578,2556284,3457027,4654670,6240974,8334326
%N A078407 Number of ways to partition 4*n+2 into distinct positive integers.
%t A078407 Table[PartitionsQ[4n+2], {n, 0, 40}]
%Y A078407 Bisection of A035294. Cf. A078406.
%Y A078407 a(n) = t(4*n+2, 0), t as defined in A079211.
%K A078407 nonn,easy
%O A078407 0,2
%A A078407 _N. J. A. Sloane_, Dec 27 2002
%E A078407 More terms from _Don Reble_, Jan 05 2003