The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A367469 a(n) is the total number of movable letters in all members of the partitions of [n]. 1
0, 1, 6, 29, 140, 704, 3732, 20915, 123832, 773051, 5076174, 34973432, 252212600, 1899483793, 14908277490, 121701247649, 1031472019760, 9061405440156, 82384690078948, 774102548613907, 7507335441107420, 75055820357153647, 772694054961218802, 8182814265240466788 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Toufik Mansour and Mark Shattuck, Counting set partitions by the number of movable letters, Journal of Difference Equations and Applications, 26:3, 384-403, (2020). On ResearchGate. See Theorem 8.
FORMULA
a(n) = (2*n - 1)*B(n)/2 - B(n+1)/2 + B(n-1)/2, where B(n) = A000110(n).
MATHEMATICA
a[n_]:=(2n-1)BellB[n]/2-BellB[n+1]/2+BellB[n-1]/2; Array[a, 24]
CROSSREFS
Cf. A000110.
Row sums of A367468.
Sequence in context: A110311 A030221 A271753 * A009153 A012325 A125785
KEYWORD
nonn
AUTHOR
Stefano Spezia, Nov 19 2023
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 17 18:36 EDT 2024. Contains 373463 sequences. (Running on oeis4.)