Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108206
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108206 a(n)= 3*(n-1)*a(n-1) +(n-1)*a(n-2), with a(0)=1, a(1)=1. +0
1
0, 1, 3, 20, 189, 2348, 36165, 665058, 14219373, 346585416, 9485780589, 288039271830, 9609639556869, 349403495309244, 13751661631299813, 582461437448921562, 26417039609670967485, 1277337284263389184272 (list; graph; listen)
OFFSET

0,3

COMMENT

This is also the (2,2) element of the product matrix after multiplying the unit matrix from the

left by the matrices (0,1;j-1,3j-3) in the order j=2 to n.

MATHEMATICA

M[n_] := {{0, 1}, {(n - 1), 3*(n - 1)}} v[1] = {0, 1} v[n_] := v[n] = M[n].v[n - 1] a = Table[Abs[v[n][[1]]], {n, 1, 25}]

CROSSREFS

Cf. A000166.

Sequence in context: A085390 A065980 A073767 this_sequence A120485 A087152 A158833

Adjacent sequences: A108203 A108204 A108205 this_sequence A108207 A108208 A108209

KEYWORD

nonn,easy

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jun 15 2005

EXTENSIONS

Definition replaced by recurrence by the Associate Editors of the OEIS, Sep 28 2009

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 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research