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!)
A192574 a(n) = sum(binomial(n,k)*floor(sqrt(Bell(k)))*floor(sqrt(Bell(n-k))),k=0..n). 2

%I #4 Mar 30 2012 18:55:30

%S 1,2,4,10,28,84,282,968,3574,13526,53248,215288,889072,3749808,

%T 16120368,70569136,314384296,1424490556,6561255338,30706715780,

%U 145947430208,704170163362,3447329246534,17116783509170,86161074446406,439511863198824,2271055875812692

%N a(n) = sum(binomial(n,k)*floor(sqrt(Bell(k)))*floor(sqrt(Bell(n-k))),k=0..n).

%t Table[Sum[Binomial[n,k]Floor[Sqrt[BellB[k]]]Floor[Sqrt[BellB[n-k]]],{k,0,n}],{n,0,100}]

%o (Maxima) makelist(sum(binomial(n,k)*floor(sqrt(belln(k)))*floor(sqrt(belln(n-k))),k,0,n),n,0,28);

%Y Cf. A192570, A192571, A192572, A192573.

%K nonn

%O 0,2

%A _Emanuele Munarini_, Jul 04 2011

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 May 8 14:31 EDT 2024. Contains 372334 sequences. (Running on oeis4.)