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.

A240017 Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 8.

This page as a plain text file.
%I A240017 #5 Mar 30 2014 18:23:27
%S A240017 1,0,1,1,2,2,4,4,7,8,12,14,21,24,34,41,55,66,87,105,135,165,206,252,
%T A240017 313,380,466,567,688,833,1006,1212,1454,1748,2083,2495,2963,3532,4177,
%U A240017 4965,5848,6924,8134,9593,11236,13212,15429,18082,21070,24613,28611,33332
%N A240017 Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 8.
%C A240017 With offset 16 number of partitions of n, where the difference between the number of odd parts and the number of even parts is -8.
%H A240017 Alois P. Heinz, <a href="/A240017/b240017.txt">Table of n, a(n) for n = 8..1000</a>
%p A240017 b:= proc(n, i, t) option remember; `if`(abs(t)>n, 0,
%p A240017       `if`(n=0, 1, `if`(i<1, 0, b(n, i-1, t)+
%p A240017       `if`(i>n, 0, b(n-i, i, t+(2*irem(i, 2)-1))))))
%p A240017     end:
%p A240017 a:= n-> b(n$2, -8):
%p A240017 seq(a(n), n=8..80);
%Y A240017 Column k=8 of A240009.
%K A240017 nonn
%O A240017 8,5
%A A240017 _Alois P. Heinz_, Mar 30 2014