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.

A318398 Number of triples of set partitions of {1,2,...,n} whose meet is {{1},{2},...,{n}}.

This page as a plain text file.
%I A318398 #9 Jan 22 2023 20:45:12
%S A318398 1,7,103,2707,110857,6517129,521167549,54510591469,7235648605909,
%T A318398 1190181847444189,237953165658759679,56905537750421669449,
%U A318398 16059682765076576965879,5287171379685771887014489,2010360123437921314268936809,875173620070717892287441139989
%N A318398 Number of triples of set partitions of {1,2,...,n} whose meet is {{1},{2},...,{n}}.
%F A318398 a(n) = Sum_{k = 0..n} s(n,k)*B(k)^3 where s = A048994 and B = A000110.
%e A318398 The a(2) = 7 triples:
%e A318398   {{1},{2}} {{1},{2}} {{1},{2}}
%e A318398   {{1},{2}} {{1},{2}}  {{1,2}}
%e A318398   {{1},{2}}  {{1,2}}  {{1},{2}}
%e A318398   {{1},{2}}  {{1,2}}   {{1,2}}
%e A318398    {{1,2}}  {{1},{2}} {{1},{2}}
%e A318398    {{1,2}}  {{1},{2}}  {{1,2}}
%e A318398    {{1,2}}   {{1,2}}  {{1},{2}}
%t A318398 Table[Sum[StirlingS1[n,k]*BellB[k]^3,{k,0,n}],{n,10}]
%Y A318398 Cf. A000110, A000258, A001247, A008277, A048994, A059849, A060639, A181939, A318389, A318391, A318393, A318399.
%K A318398 nonn
%O A318398 1,2
%A A318398 _Gus Wiseman_, Aug 25 2018