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.

A331927 Number of compositions (ordered partitions) of n into distinct divisors of n.

This page as a plain text file.
%I A331927 #9 Feb 01 2020 22:36:34
%S A331927 1,1,1,1,1,1,7,1,1,1,1,1,31,1,1,1,1,1,31,1,25,1,1,1,895,1,1,1,121,1,
%T A331927 151,1,1,1,1,1,1135,1,1,1,865,1,31,1,1,1,1,1,11935,1,1,1,1,1,151,1,
%U A331927 841,1,1,1,129439,1,1,1,1,1,127,1,1,1,1
%N A331927 Number of compositions (ordered partitions) of n into distinct divisors of n.
%H A331927 <a href="/index/Com#comp">Index entries for sequences related to compositions</a>
%F A331927 a(n) = A331928(n) + 1 for n > 0.
%e A331927 a(6) = 7 because we have [6], [3, 2, 1], [3, 1, 2], [2, 3, 1], [2, 1, 3], [1, 3, 2] and [1, 2, 3].
%o A331927 (PARI) a(n)={if(n==0, 1, my(v=divisors(n)); subst(serlaplace(polcoef(prod(i=1, #v, 1 + y*x^v[i] + O(x*x^n)), n)), y, 1))} \\ _Andrew Howroyd_, Feb 01 2020
%Y A331927 Cf. A018818, A027750, A033630, A065205, A100346, A210442, A211111, A294138, A331928.
%K A331927 nonn
%O A331927 0,7
%A A331927 _Ilya Gutkovskiy_, Feb 01 2020