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.

A368871 Number of compositions (ordered partitions) of n into odd parts not greater than sqrt(n).

This page as a plain text file.
%I A368871 #6 Jan 15 2024 11:14:03
%S A368871 1,1,1,1,1,1,1,1,1,19,28,41,60,88,129,189,277,406,595,872,1278,1873,
%T A368871 2745,4023,5896,40893,64208,100816,158296,248548,390257,612761,962125,
%U A368871 1510678,2371987,3724369,5847808,9181920,14416967,22636762,35543051
%N A368871 Number of compositions (ordered partitions) of n into odd parts not greater than sqrt(n).
%p A368871 b:= proc(n, t) option remember; `if`(n=0, 1, add(
%p A368871      `if`(j::odd, b(n-j, t), 0), j=1..min(n, t)))
%p A368871     end:
%p A368871 a:= n-> b(n, floor(sqrt(n))):
%p A368871 seq(a(n), n=0..40);  # _Alois P. Heinz_, Jan 13 2024
%t A368871 Table[SeriesCoefficient[1/(1 - Sum[Boole[OddQ[k]] x^k, {k, 1, Floor[Sqrt[n]]}]), {x, 0, n}], {n, 0, 40}]
%Y A368871 Cf. A000045, A364526.
%K A368871 nonn
%O A368871 0,10
%A A368871 _Ilya Gutkovskiy_, Jan 08 2024