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.
%I A286041 #34 May 25 2020 10:41:10
%S A286041 1,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,8,8,10,11,14,15,19,21,26,29,35,39,47,
%T A286041 52,61,68,79,87,100,110,126,138,156,171,193,211,237,259,290,317,354,
%U A286041 387,432,472,525,575,639,699,776,849,941,1030,1139,1246,1377,1505,1659,1813,1996,2178,2394,2610,2863,3119,3415,3716,4064,4416,4820,5234,5705,6187,6735,7297,7932
%N A286041 Number of partitions of n with parts differing by at least two and with an even number of parts.
%H A286041 Alois P. Heinz, <a href="/A286041/b286041.txt">Table of n, a(n) for n = 0..5000</a>
%F A286041 a(n) = A003114(n) - A286316(n).
%F A286041 a(n) ~ phi^(1/2) * exp(2*Pi*sqrt(n/15)) / (4 * 3^(1/4) * 5^(1/2) * n^(3/4)), where phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - _Vaclav Kotesovec_, Mar 05 2020
%t A286041 Table[Length@ Select[IntegerPartitions@n, Min[-Differences@#] > 1 && EvenQ@Length@# &], {n, 80}]
%Y A286041 Cf. A003114, A286316, A039924.
%K A286041 nonn
%O A286041 0,7
%A A286041 _George Beck_, May 06 2017
%E A286041 a(0)=1 prepended by _Alois P. Heinz_, May 07 2017