Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002436
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002436 E.g.f.: Sum_{n >= 0} a(n)*x^(2*n)/(2*n)! = sec(2x).
(Formerly M3701 N1512)
+0
8
1, 4, 80, 3904, 354560, 51733504, 11070525440, 3266330312704, 1270842139934720, 630424777638805504, 388362339077351014400, 290870261262635870715904, 260290690801376575335956480 (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.

Glaisher, J. W. L., Quart. J. Pure Appl. Math., 44 (1913), 105-112.

FORMULA

4^n * A000364(n).

MAPLE

A := n -> (-4)^n*euler(2*n); (Then A(n) = a(n+1) for n >= 0.) [From Peter Luschny (peter(AT)luschny.de), Jan 27 2009]

PROGRAM

(PARI) a(n)=if(n<0, 0, 4^n*(2*n)!*polcoeff(1/cos(x+O(x^(2*n+1))), 2*n))

CROSSREFS

Cf. A002436(n)=A000831(2n).

Equals 2 * A000816(n-1), n>1.

Sequence in context: A012824 A012057 A102063 this_sequence A013031 A012923 A012922

Adjacent sequences: A002433 A002434 A002435 this_sequence A002437 A002438 A002439

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Michael Somos, Jun 21, 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research