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.
%I A097341 #18 May 17 2023 18:09:44
%S A097341 1,0,2,2,6,14,38,110,342,1134,3990,14830,58006,237998,1021462,4574318,
%T A097341 21325462,103287598,518768406,2697426926,14498316182,80440333998,
%U A097341 460112203798,2710038058862,16418576767126,102212840258094,653247225514262,4282249051881198
%N A097341 a(n) = Sum_{k=0..floor(n/2)} Stirling2(n-k,k) * 2^k.
%H A097341 Seiichi Manyama, <a href="/A097341/b097341.txt">Table of n, a(n) for n = 0..654</a>
%F A097341 a(n)=sum{k=0..floor(n/2), sum{i=0..k, (-1)^(k+i)i^(n-k)/(i!(k-i)!)}2^k }
%F A097341 G.f.: Sum_{k>=0} 2^k * x^(2*k)/Product_{j=1..k} (1 - j * x). - _Seiichi Manyama_, Apr 09 2022
%o A097341 (PARI) my(N=40, x='x+O('x^N)); Vec(sum(k=0, N, 2^k*x^(2*k)/prod(j=1, k, 1-j*x))) \\ _Seiichi Manyama_, Apr 09 2022
%o A097341 (PARI) a(n) = sum(k=0, n\2, 2^k*stirling(n-k, k, 2)); \\ _Seiichi Manyama_, Apr 09 2022
%Y A097341 Cf. A024427, A097342, A119429, A119430, A171367.
%K A097341 easy,nonn
%O A097341 0,3
%A A097341 _Paul Barry_, Aug 05 2004