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.

A286226 Number of compositions (ordered partitions) of n into parts with an odd number of prime divisors (counted with multiplicity).

This page as a plain text file.
%I A286226 #10 Feb 16 2025 08:33:44
%S A286226 1,0,1,1,1,3,2,6,7,10,18,22,39,54,81,127,179,282,412,620,940,1384,
%T A286226 2106,3129,4698,7062,10531,15856,23695,35541,53304,79773,119723,
%U A286226 179262,268748,402832,603484,904821,1355652,2031963,3045374,4563604,6840316,10250612,15363248,23024904,34506390
%N A286226 Number of compositions (ordered partitions) of n into parts with an odd number of prime divisors (counted with multiplicity).
%H A286226 Amiram Eldar, <a href="/A286226/b286226.txt">Table of n, a(n) for n = 0..5000</a>
%H A286226 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeFactor.html">Prime Factor</a>
%H A286226 <a href="/index/Com#comp">Index entries for sequences related to compositions</a>
%F A286226 G.f.: 1/(1 - Sum_{k>=1} x^A026424(k)).
%e A286226 a(5) = 3 because we have [5], [3, 2] and [2, 3].
%t A286226 nmax = 46; CoefficientList[Series[1/(1 - Sum[Boole[OddQ[PrimeOmega[k]]] x^k, {k, 1, nmax}]), {x, 0, nmax}], x]
%Y A286226 Cf. A026424, A286218, A286222, A286224, A286227.
%K A286226 nonn
%O A286226 0,6
%A A286226 _Ilya Gutkovskiy_, May 04 2017