login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

A271607
Number of set partitions of [2n+1] such that n+1 is the largest element of the last block.
2
1, 1, 6, 63, 1039, 24190, 745107, 29058813, 1389893708, 79588371929, 5353760622719, 416660175523064, 37047640989016445, 3724084616168887373, 419437505978046355690, 52523298180976612585435, 7263669823685446959438851, 1102849583101324096499809166
OFFSET
0,3
COMMENTS
Each set partition is written as a sequence of blocks, ordered by the smallest elements in the blocks.
LINKS
FORMULA
a(n) = A271466(2n+1,n+1).
EXAMPLE
a(0) = 1: 1.
a(1) = 1: 13|2.
a(2) = 6: 1245|3, 145|23, 145|2|3, 14|25|3, 15|24|3, 1|245|3.
a(3) = 63: 123567|4, 12567|34, 12567|3|4, 1256|37|4, ..., 1|26|357|4, 17|2|356|4, 1|27|356|4, 1|2|3567|4.
CROSSREFS
Cf. A271466.
Sequence in context: A213644 A280476 A295241 * A360481 A079244 A023815
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Apr 10 2016
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy