cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A385985 a(0) = 1; a(n) = Sum_{k=0..n-1} (2^k + 1) * binomial(n-1,k) * a(k) * a(n-1-k).

This page as a plain text file.
%I A385985 #9 Jul 14 2025 10:03:22
%S A385985 1,2,10,94,1514,40790,1862050,148965310,21742138970,5994070800710,
%T A385985 3197362825740850,3348408098259631150,6941708283693589284650,
%U A385985 28621208382355252313372150,235296246090820978083474438850,3862393961855717768080204865278750,126690441172711092666839985418516720250
%N A385985 a(0) = 1; a(n) = Sum_{k=0..n-1} (2^k + 1) * binomial(n-1,k) * a(k) * a(n-1-k).
%F A385985 E.g.f. A(x) satisfies A'(x) = A(x) * (A(x) + A(2*x)).
%o A385985 (PARI) a_vector(n) = my(v=vector(n+1)); v[1]=1; for(i=1, n, v[i+1]=sum(j=0, i-1, (2^j+1)*binomial(i-1, j)*v[j+1]*v[i-j])); v;
%Y A385985 Cf. A385617, A385619.
%K A385985 nonn
%O A385985 0,2
%A A385985 _Seiichi Manyama_, Jul 14 2025