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.

A270964 Number of set partitions of [n] having exactly ten pairs (m,m+1) such that m+1 is in some block b and m is in block b+1.

This page as a plain text file.
%I A270964 #5 Mar 27 2016 14:30:47
%S A270964 1,281,13297,348523,6807872,113042841,1709159987,24469725009,
%T A270964 339634663517,4638106688642,62916588549562,853199404241913,
%U A270964 11616795214297568,159290998975659690,2204454156023259166,30838108887627521579,436552647970998600862,6258905749718943712307
%N A270964 Number of set partitions of [n] having exactly ten pairs (m,m+1) such that m+1 is in some block b and m is in block b+1.
%H A270964 Alois P. Heinz, <a href="/A270964/b270964.txt">Table of n, a(n) for n = 15..220</a>
%H A270964 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%Y A270964 Column k=10 of A270953.
%K A270964 nonn
%O A270964 15,2
%A A270964 _Alois P. Heinz_, Mar 26 2016