Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104095
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104095 Let v[0]={0,1,1,2}, v[n]=M.v[n-1], where M={{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 10, 19, 1}}; then a(n) =v[n][[1]] (the first term). +0
1
0, 1, 1, 2, 31, 80, 690, 2522, 16463, 71361, 410068, 1933079, 10454444, 51354986, 269730280, 1351952533, 7000832157, 35436588070, 182241654663, 926897102096, 4750855253550, 24219753328074, 123937215821147, 632547978692149 (list; graph; listen)
OFFSET

0,4

MATHEMATICA

M={{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 10, 19, 1}} v[0] = {0, 1, 1, 2}; v[n_] := v[n] = M.v[n - 1] a = Table[v[n][[1]], {n, 0, 50}]

CROSSREFS

Sequence in context: A091252 A031920 A054207 this_sequence A030459 A141978 A101254

Adjacent sequences: A104092 A104093 A104094 this_sequence A104096 A104097 A104098

KEYWORD

nonn

AUTHOR

Roger Bagula (rlbagulatftn(AT)earthink.net), Mar 31 2005

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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research