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!)
A331519 a(0) = 1; a(n) = Sum_{k=1..n} (binomial(n,k) mod 2) * a(k-1) * a(n-k). 0

%I #5 Jan 19 2020 09:20:04

%S 1,1,1,3,3,9,15,63,63,189,315,1323,1701,6237,12285,59535,59535,178605,

%T 297675,1250235,1607445,5893965,11609325,56260575,63761985,213790185,

%U 393824025,1811590515,2531725875,10025634465,21210236775,109876902975,109876902975,329630708925

%N a(0) = 1; a(n) = Sum_{k=1..n} (binomial(n,k) mod 2) * a(k-1) * a(n-k).

%t a[0] = 1; a[n_] := a[n] = Sum[Mod[Binomial[n, k], 2] a[k - 1] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 33}]

%Y Cf. A000108, A001147, A047749, A047999, A062177, A166966.

%K nonn

%O 0,4

%A _Ilya Gutkovskiy_, Jan 19 2020

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 April 23 14:15 EDT 2024. Contains 371914 sequences. (Running on oeis4.)