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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122704 a(n)=Sum_{k, 0<=k<=n}3^(n-k)*A123125(n,k). 4
1, 1, 4, 22, 160, 1456, 15904, 202672, 2951680, 48361216, 880405504, 17630351872, 385148108800, 9114999832576, 232311251144704, 6343764407375872, 184778982658539520 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

a(n+1)=[1,4,22,160,1456,...]is the first Eulerian transform of A000244 (powers of 3), it is also the Stirling transform of A080599(n+1)=[1,3,12,66,450,...].

FORMULA

O.g.f.: Sum_{n>=0} n! * x^n / Product_{k=1..n} (1-2*k*x). [From Paul D. Hanna, Jul 20 2011]

a(n) = Sum_{k, 0<=k<=n} A131689(n,k)*2^(n-k). - Philippe DELEHAM, Oct 09 2007

a(n) = A_{n}(3) where A_{n}(x) are the <a href="http://oeis.org/wiki/Eulerian_polynomials"> Eulerian polynomials</a>. - Peter Luschny

PROG

(PARI) {a(n)=polcoeff(sum(m=0, n, m!*x^m/prod(k=1, m, 1-2*k*x+x*O(x^n))), n)} /* Paul D. Hanna, Jul 20 2011 */

CROSSREFS

Sequence in context: A112697 A113717 A124563 * A087547 A184942 A000779

Adjacent sequences:  A122701 A122702 A122703 * A122705 A122706 A122707

KEYWORD

nonn

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 22 2006

EXTENSIONS

a(7) corrected (was 206672), a(n) extended, formula added Peter Luschny (peter(AT)luschny.de), Aug 03 2010

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 February 17 02:48 EST 2012. Contains 205978 sequences.