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.

A331848 Number of partitions of n into odd parts with some part repeated.

This page as a plain text file.
%I A331848 #6 Jan 29 2020 14:51:14
%S A331848 0,0,1,1,1,2,3,4,4,6,8,10,12,15,19,23,27,33,41,48,57,68,81,95,111,130,
%T A331848 153,178,206,239,278,320,367,423,486,556,635,725,827,941,1067,1211,
%U A331848 1374,1553,1753,1980,2232,2512,2823,3171,3560,3990,4465,4995,5585,6234,6951,7749
%N A331848 Number of partitions of n into odd parts with some part repeated.
%C A331848 Also number of partitions of n into distinct parts with at least one even part.
%H A331848 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A331848 a(n) = A000009(n) - A000700(n).
%e A331848 a(6) = 3 because we have [3, 3], [3, 1, 1, 1] and [1, 1, 1, 1, 1, 1].
%Y A331848 Cf. A000009, A000700, A047967, A261982, A331849.
%K A331848 nonn
%O A331848 0,6
%A A331848 _Ilya Gutkovskiy_, Jan 29 2020