Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121987
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121987 Let M(n) = {{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {-n - 1, 0, 0, n + 1}}; v[0] = {1, 1, 1, 1}; v[n] = M(n).v[n - 1] + {0, 0, 0, n + 1}; then a(n) = v[n][[1]]. +0
1
1, 1, 1, 1, 2, 6, 24, 120, 714, 4963, 39520, 354609, 3538960, 38873978, 466013508, 6053565700, 84700374374, 1269922505955, 20311303879168, 345189255328973, 6211881989182800, 118001629266860074, 2359626359259618140 (list; graph; listen)
OFFSET

0,5

COMMENT

A 4 X 4 Markov chain that begins like n! but then falls short.

MATHEMATICA

M = {{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {-n - 1, 0, 0, n + 1}}; v[0] = {1, 1, 1, 1}; v[n_] := v[n] = M.v[n - 1] + {0, 0, 0, n + 1} a = Table[v[n][[1]], {n, 0, 30}]

CROSSREFS

Sequence in context: A152340 A152347 A068200 this_sequence A164872 A052398 A047890

Adjacent sequences: A121984 A121985 A121986 this_sequence A121988 A121989 A121990

KEYWORD

nonn

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Sep 10 2006

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jun 17 2007

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research