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.

A270963 Number of set partitions of [n] having exactly nine 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 A270963 #4 Mar 27 2016 14:30:13
%S A270963 5,522,17506,368606,6131236,89714397,1222378331,16017586392,
%T A270963 205773378304,2622730297478,33419633878019,427875505471609,
%U A270963 5523038725443790,72044774875932494,951266975170654957,12728521821662549888,172734660881786725453,2378751774455132263522
%N A270963 Number of set partitions of [n] having exactly nine pairs (m,m+1) such that m+1 is in some block b and m is in block b+1.
%H A270963 Alois P. Heinz, <a href="/A270963/b270963.txt">Table of n, a(n) for n = 14..220</a>
%H A270963 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%Y A270963 Column k=9 of A270953.
%K A270963 nonn
%O A270963 14,1
%A A270963 _Alois P. Heinz_, Mar 26 2016