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.

A270960 Number of set partitions of [n] having exactly six 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 A270960 #7 Jun 02 2025 12:17:23
%S A270960 1,76,1650,23031,264716,2788215,28315287,284453798,2865664275,
%T A270960 29172005637,301410662549,3169264274716,33967946651067,
%U A270960 371460612845541,4146934516914449,47274580420037008,550357684288267873,6542615612312034842,79410538735157560508
%N A270960 Number of set partitions of [n] having exactly six pairs (m,m+1) such that m+1 is in some block b and m is in block b+1.
%H A270960 Alois P. Heinz, <a href="/A270960/b270960.txt">Table of n, a(n) for n = 10..220</a>
%H A270960 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%e A270960 a(10) = 1: 136(10)|259|48|7.
%Y A270960 Column k=6 of A270953.
%K A270960 nonn
%O A270960 10,2
%A A270960 _Alois P. Heinz_, Mar 26 2016