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.

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

This page as a plain text file.
%I A347869 #13 May 22 2024 15:12:52
%S A347869 1,2,3,5,7,10,14,21,29,41,55,75,98,131,171,225,290,376,479,613,775,
%T A347869 981,1231,1545,1923,2393,2959,3656,4492,5515,6737,8223,9994,12133,
%U A347869 14676,17732,21351,25679,30793,36879,44049,52549,62535,74329,88153,104418,123437,145746,171765,202193
%N A347869 Number of partitions of n such that 5*(greatest part) >= (number of parts).
%C A347869 Also, the number of partitions of n such that (greatest part) <= 5*(number of parts).
%F A347869 G.f.: Sum_{k>=1} x^k * Product_{j=1..k} (1-x^(5*k+j-1))/(1-x^j).
%o A347869 (PARI) my(N=66, x='x+O('x^N)); Vec(sum(k=1, N, x^k*prod(j=1, k, (1-x^(5*k+j-1))/(1-x^j))))
%Y A347869 Cf. A064174, A237755, A347867, A347868.
%Y A347869 Cf. A348164.
%K A347869 nonn
%O A347869 1,2
%A A347869 _Seiichi Manyama_, Jan 25 2022