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.

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

This page as a plain text file.
%I A386510 #11 Jul 24 2025 07:24:11
%S A386510 1,1,3,34,949,52421,5050711,779516095,181069531665,60337677803905,
%T A386510 27766510630927741,17108421087708824831,13757393965653865220629,
%U A386510 14130398908817131991819653,18201370833558663815315691987,28941823262680770630349968403381,56033750665620660972762531436196641
%N A386510 a(0) = 1; a(n) = a(n-1) + Sum_{k=0..n-1} (1 + k) * binomial(k+1,2) * binomial(n-1,k) * a(k) * a(n-1-k).
%F A386510 E.g.f. A(x) satisfies A(x) = exp( x + x^2 * (d/dx A(x)) + x^3/2 * (d^2/dx^2 A(x)) ).
%o A386510 (PARI) a_vector(n) = my(v=vector(n+1)); v[1]=1; for(i=1, n, v[i+1]=v[i]+sum(j=0, i-1, (1+j)*binomial(j+1, 2)*binomial(i-1, j)*v[j+1]*v[i-j])); v;
%Y A386510 Cf. A143925, A386511, A386512, A386513.
%Y A386510 Cf. A386452, A386505.
%K A386510 nonn
%O A386510 0,3
%A A386510 _Seiichi Manyama_, Jul 24 2025