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.

A347868 Number of partitions of n such that 4*(greatest part) >= (number of parts).

This page as a plain text file.
%I A347868 #14 May 22 2024 15:12:57
%S A347868 1,2,3,5,6,10,14,21,29,40,53,73,96,129,168,221,284,369,471,603,763,
%T A347868 966,1211,1521,1892,2355,2912,3600,4423,5434,6639,8107,9855,11968,
%U A347868 14476,17495,21067,25342,30393,36406,43489,51891,61761,73421,87087,103172,121977,144045,169780,199883
%N A347868 Number of partitions of n such that 4*(greatest part) >= (number of parts).
%C A347868 Also, the number of partitions of n such that (greatest part) <= 4*(number of parts).
%F A347868 G.f.: Sum_{k>=1} x^k * Product_{j=1..k} (1-x^(4*k+j-1))/(1-x^j).
%o A347868 (PARI) my(N=66, x='x+O('x^N)); Vec(sum(k=1, N, x^k*prod(j=1, k, (1-x^(4*k+j-1))/(1-x^j))))
%Y A347868 Cf. A064174, A237755, A347867, A347869.
%Y A347868 Cf. A348163.
%K A347868 nonn
%O A347868 1,2
%A A347868 _Seiichi Manyama_, Jan 25 2022