Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045379
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A045379 E.g.f.: exp(4*z+exp(z)-1). +0
4
1, 5, 26, 141, 799, 4736, 29371, 190497, 1291020, 9131275, 67310847, 516369838, 4116416797, 34051164985, 291871399682, 2588914083065, 23733360653955, 224592570163192, 2191466128865567, 22024934452712437, 227771488390279260 (list; graph; listen)
OFFSET

0,2

LINKS

J. W. Layman, The Hankel Transform and Some of its Properties, J. Integer Sequences, 4 (2001), #01.1.5.

FORMULA

a(n) = EXP(-1)*sum(k=>0, (k+4)^(n)/k!) - Gerald McGarvey (Gerald.McGarvey(AT)comcast.net), Jun 03 2004

A recursive formula to compute some integer sequences (including A000110, A005493, A005494 and the present sequence). Define G(n, m), where n, m >= 0, as follows: G(0, m) = 1; G(n, m) = G(n-1, m) * (m+1) + G(n-1, m+1), where n > 0. Then G(n, 0) = A000110(n+1); G(n, 1) = A005493(n+1); G(n, 2) = A005494(n+1); G(n, 3) = A045379(n+1) - Alexey Andreev (ava12(AT)nm.ru), Jan 05 2006

Define f_1(x),f_2(x),... such that f_1(x)=x^3*e^x, f_{n+1}(x)=diff(x*f_n(x),x), for n=2,3,.... Then a(n-1)=e^{-1}*f_n(1). - Milan R. Janjic (agnus(AT)blic.net), May 30 2008

CROSSREFS

Cf. A000110 A005493 A005494.

Cf. A000110, A005493, A005494, A045379.

Sequence in context: A081911 A081187 A104498 this_sequence A053487 A082029 A001705

Adjacent sequences: A045376 A045377 A045378 this_sequence A045380 A045381 A045382

KEYWORD

nonn

AUTHOR

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

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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research