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.

A368502 Number of partitions of an n-set into blocks of size <= sqrt(n).

This page as a plain text file.
%I A368502 #6 Dec 27 2023 22:37:22
%S A368502 1,1,1,1,10,26,76,232,764,12644,61136,312676,1680592,9467680,55704104,
%T A368502 341185496,6631556521,49294051497,380306658250,3039453750685,
%U A368502 25120541332271,214363100120051,1885987611214092,17085579637664715,159185637725413675,3282701194678476257
%N A368502 Number of partitions of an n-set into blocks of size <= sqrt(n).
%F A368502 a(n) = n! * [x^n] exp( Sum_{1 <= j <= sqrt(n)} x^j / j! ).
%t A368502 Table[n! SeriesCoefficient[Exp[Sum[x^j/j!, {j, 1, Floor[Sqrt[n]]}]], {x, 0, n}], {n, 0, 25}]
%Y A368502 Cf. A000110, A097356, A368503.
%K A368502 nonn
%O A368502 0,5
%A A368502 _Ilya Gutkovskiy_, Dec 27 2023