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.

A001829 Related to graded partially ordered sets.

This page as a plain text file.
%I A001829 M4252 N1776 #34 Mar 31 2023 14:09:45
%S A001829 1,6,46,450,5650,91866,1957066,55363650,2109599650,109773407466,
%T A001829 7894945079386,792252362302770,111671194813402930,
%U A001829 22202849561274787866,6241728810901739517226,2484011055161613143144610,1400187830319472451472442690
%N A001829 Related to graded partially ordered sets.
%C A001829 Corresponds to the numbers c(6,n) in the Klarner paper. - _Sean A. Irvine_, Sep 24 2015
%D A001829 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A001829 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A001829 John Cerkan, <a href="/A001829/b001829.txt">Table of n, a(n) for n = 0..112</a>
%H A001829 D. A. Klarner, <a href="/A000798/a000798_11.pdf">The number of graded partially ordered sets</a>, J. Combin. Theory, 6 (1969), 12-19. [Annotated scanned copy]
%H A001829 D. A. Klarner, <a href="http://dx.doi.org/10.1016/S0021-9800(69)80100-6">The number of graded partially ordered sets</a>, J. Combin. Theory, 6 (1969), 12-19.
%H A001829 <a href="/index/Pos#posets">Index entries for sequences related to posets</a>
%F A001829 a(n) = Sum_{p+q+r+s+t+u=n} (n!/p!q!r!s!t!u!) 2^(pq+qr+rs+st+tu) where (p,q,r,s,t,u) is any nonnegative composition of n. - _Sean A. Irvine_, Sep 24 2015
%Y A001829 Column k=6 of A361950.
%Y A001829 Cf. A000684, A001827, A001828, A001830, A047863.
%K A001829 nonn
%O A001829 0,2
%A A001829 _N. J. A. Sloane_