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.

A320620 Number of ordered set partitions of [n] where k = seven is minimal such that for each block b the smallest integer interval containing b has at most k elements.

This page as a plain text file.
%I A320620 #4 Oct 17 2018 17:29:59
%S A320620 4683,81078,1148016,15821592,223324968,3291487548,51390688648,
%T A320620 853336081124,14968971308424,276240216296568,5347594452033174,
%U A320620 108358364062922106,2294379672012591648,50691426196004660946,1167051922550186976006,27960460507841919880920
%N A320620 Number of ordered set partitions of [n] where k = seven is minimal such that for each block b the smallest integer interval containing b has at most k elements.
%H A320620 Alois P. Heinz, <a href="/A320620/b320620.txt">Table of n, a(n) for n = 7..450</a>
%Y A320620 Column k=7 of A276891.
%Y A320620 Cf. A320557.
%K A320620 nonn
%O A320620 7,1
%A A320620 _Alois P. Heinz_, Oct 17 2018