login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002438 Multiples of Euler numbers.
(Formerly M4029 N1672)
3
1, 5, 205, 22265, 4544185, 1491632525, 718181418565, 476768795646785, 417370516232719345, 465849831125196593045, 645702241048404020542525, 1088120580608731523115639305, 2190881346273790815462670984105 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

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.; Messenger of Math., 28 (1898), 36-79, see esp. p. 51.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=1..13.

FORMULA

A000364(n) * (3^(2n)+1)/2.

a(n+1) = Sum_{k, 0<=k<=n} A086646(n, k)*(-4)^k*9^(n-k). - Philippe DELEHAM, Aug 26 2005

MATHEMATICA

a[n_] := (1+9^(n-1))*Abs[EulerE[2*(n-1)]]/2; Table[ a[n], {n, 1, 13}](* From Jean-François Alcover, Feb 10 2012 *)

CROSSREFS

Sequence in context: A012811 A186722 A060486 * A005333 A162087 A068531

Adjacent sequences:  A002435 A002436 A002437 * A002439 A002440 A002441

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from H. P. Robinson.

More terms from Jon E. Schoenfield (jonscho(AT)hiwaay.net), May 09 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 23 23:31 EDT 2013. Contains 225613 sequences.