|
Search: id:A002435
|
|
|
| A002435 |
|
Second-order Euler numbers.
(Formerly M1686 N0665)
|
|
+0
1
|
|
| 0, 2, 6, 28, 180, 662, 7266, 24568, 408360, 1326122, 30974526, 98329108, 3065784540, 9596075582, 384653685786, 1192744081648, 59724464976720, 183983154281042, 11249503075325046, 34489251602450188
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
A. Fletcher, J. C. P. Miller, L. Rosenhead and L. J. Comrie, An Index of Mathematical Tables. Vols. 1 and 2, 2nd ed., Blackwell, Oxford and Addison-Wesley, Reading, MA, 1962, Vol. 1, p. 75.
M. A. Stern, Zur Theorie der Eulerschen Zahlen, J. Reine Angew. Math., 79 (1875), 67-98.
|
|
LINKS
|
Index entries for sequences related to Stern's sequences
|
|
MAPLE
|
F := 2/(exp(x)+exp(-x)): z := ((exp(x)-exp(-x))/(exp(x)+exp(-x)))^2: w := simplify(diff(z, x)): p := proc(n) if n mod 2 = 0 then simplify(subs(x=0, (-1)^(1+floor(n/2))*simplify(diff(diff(F, x$n)/F, x)/w))) else simplify(subs(x=0, (-1)^(1+floor(n/2))*simplify(diff(diff(F, x$n)/simplify(diff(F, x)), x)/w))) fi end: seq(p(n), n=1..28);
|
|
CROSSREFS
|
Sequence in context: A140092 A052809 A136631 this_sequence A104018 A100526 A084262
Adjacent sequences: A002432 A002433 A002434 this_sequence A002436 A002437 A002438
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms and Maple code from Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 09 2004
|
|
|
Search completed in 0.002 seconds
|
