Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122704
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122704 a(n)=Sum_{k, 0<=k<=n}3^(n-k)*A123125(n,k). +0
3
1, 1, 4, 22, 160, 1456, 15904, 206672 (list; graph; listen)
OFFSET

0,3

COMMENT

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

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

CROSSREFS

Adjacent sequences: A122701 A122702 A122703 this_sequence A122705 A122706 A122707

Sequence in context: A112697 A113717 A124563 this_sequence A087547 A000779 A053144

KEYWORD

nonn

AUTHOR

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

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research