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.

A137697 a(n) = x(n) * 2^((n mod 2 - 1)/2), with x(n)=Sum(x(k)*x(n-k-1):0<=k

Original entry on oeis.org

1, 2, 4, 20, 56, 336, 1056, 6864, 22880, 155584, 537472, 3762304, 13312768, 95091200, 342328320, 2481880320, 9051563520, 66378132480
Offset: 0

Views

Author

Reinhard Zumkeller, Feb 06 2008

Keywords

Examples

			x(1) = 2;
x(2) = 5.6568... = a(2)*SQRT(2);
x(3) = 20;
x(4) = 79.1959... = a(4)*SQRT(2);
x(5) = 336;
x(6) = 1493.4095... = a(6)*SQRT(2).
		

Crossrefs

Cf. A000108.