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.

A339170 Number of compositions (ordered partitions) of n into distinct parts, the least being 7.

This page as a plain text file.
%I A339170 #5 Nov 26 2020 09:16:45
%S A339170 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,2,2,2,2,2,2,2,2,2,8,8,14,14,20,20,26,
%T A339170 26,32,32,62,62,92,116,146,170,224,248,302,350,404,572,650,818,1016,
%U A339170 1328,1526,1958,2300,2852,3314,4010,4592,6248,6974,8750,10436,13196,15722,19442,22952
%N A339170 Number of compositions (ordered partitions) of n into distinct parts, the least being 7.
%H A339170 <a href="/index/Com#comp">Index entries for sequences related to compositions</a>
%F A339170 G.f.: Sum_{k>=1} k! * x^(k*(k + 13)/2) / Product_{j=1..k-1} (1 - x^j).
%e A339170 a(24) = 8 because we have [17, 7], [9, 8, 7], [9, 7, 8], [8, 9, 7], [8, 7, 9], [7, 17], [7, 9, 8] and [7, 8, 9].
%t A339170 nmax = 64; CoefficientList[Series[Sum[k! x^(k (k + 13)/2)/Product[1 - x^j, {j, 1, k - 1}], {k, 1, nmax}], {x, 0, nmax}], x]
%Y A339170 Cf. A026800, A026828, A339108, A339162, A339163, A339164, A339165, A339166, A339169, A339171, A339172.
%K A339170 nonn
%O A339170 0,16
%A A339170 _Ilya Gutkovskiy_, Nov 25 2020