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 A007182 M1381 #20 Feb 24 2016 04:36:04
%S A007182 1,2,5,10,23,45,94,179,358,672,1292,2382,4470,8132,14937,26832,48507,
%T A007182 86205,153717,270507,476896,832001,1452283,2513705,4350072,7475915,
%U A007182 12838338,21919846,37385434,63450376,107547996,181525120,305951060,513772849,861463730
%N A007182 Dimension of n-th compound of a certain space.
%D A007182 Y. Chiricota, Équations différentielles combinatoires et calcul symbolique in "FPSAC5": Formal Power Series and Algebraic Combinatorics, Fifth Conference, Florence, Jun 21-25 1993, Vol. 2, p. 123.
%D A007182 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A007182 Alois P. Heinz, <a href="/A007182/b007182.txt">Table of n, a(n) for n = 0..1000</a>
%p A007182 b:= proc(n) option remember; `if`(n=0, 1, add(add(
%p A007182 `if`(d<2, d, `if`(d::odd, 0, b(d/2)))*d,
%p A007182 d=numtheory[divisors](j))*b(n-j), j=1..n)/n)
%p A007182 end:
%p A007182 a:= n-> b(2*n):
%p A007182 seq(a(n), n=0..40); # _Alois P. Heinz_, Jul 08 2015
%t A007182 b[n_] := b[n] = If[n==0, 1, Sum[Sum[If[d<2, d, If[OddQ[d], 0, b[d/2]]]*d, {d, Divisors[j]}]*b[n-j], {j, 1, n}]/n]; a[n_] := b[2*n]; Table[a[n], {n, 0, 40}] (* _Jean-François Alcover_, Feb 24 2016, after _Alois P. Heinz_ *)
%K A007182 nonn
%O A007182 0,2
%A A007182 _Simon Plouffe_
%E A007182 a(0), a(17)-a(34) from _Alois P. Heinz_, Jul 08 2015