The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A270967 Number of set partitions of [n] having the maximal possible number of pairs (m,m+1) such that m+1 is in some block b and m is in block b+1. 2
 1, 1, 2, 1, 6, 3, 1, 21, 10, 4, 1, 76, 36, 15, 5, 1, 281, 133, 57, 21, 6, 1, 1052, 499, 218, 85, 28, 7, 1, 3974, 1890, 838, 339, 121, 36, 8, 1, 15113, 7207, 3233, 1343, 505, 166, 45, 9, 1, 57774, 27622, 12509, 5302, 2069, 726, 221, 55, 10, 1, 221781, 106289 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..300 FORMULA a(n) = A270953(n,n-floor((1+sqrt(max(0,8*n-7)))/2)). CROSSREFS Cf. A083920, A270953. Sequence in context: A060539 A163269 A103905 * A103209 A089900 A138533 Adjacent sequences:  A270964 A270965 A270966 * A270968 A270969 A270970 KEYWORD nonn AUTHOR Alois P. Heinz, Mar 26 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 21 13:55 EST 2020. Contains 331113 sequences. (Running on oeis4.)