8 n integer, n <= 1000000 if even
13 Returns the Euler number with index n, i.e. the coefficient E_n in
16 sech(t) = Sigma E_n * t^n/n!
18 When euler(n) is computed for positive even n, the values for
19 n and smaller positive even indices are stored in a table so that
20 a later call to euler(k) with 0 <= k <= n will be executed quickly.
21 If euler(k) is called with negative k, zero is returned and the
22 memory used by the table iu freed.
24 Considerable runtime and memery are required for calculating
25 euler(n) for large even n.
28 > for (n = 0; n <= 6; n++) print euler(n),; print;
35 NUMBER *qeuler(long n)
38 bernoulli, bell, catalan, comb, fact, perm