Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121958
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121958 Quadratic n^2-n-1 functional matrix Markov of the A001053 type. +0
1
0, 1, 1, 6, 67, 1279, 37158, 1524757, 83898793, 5958339060, 530376075133, 57816950528557, 7574550895316100, 1174113205724524057, 212522064787034170417, 44418285653695866141210 (list; graph; listen)
OFFSET

1,4

COMMENT

Recursion equalivalent is: a[n]=(n^2-n-1)*a[n-1]+a[n-2] Gets large very fast.

FORMULA

M[n_] := {{0, 1}, {1, n^2 - n - 1} } v[1] = {0, 1} v[n_] := v[n] = M[n].v[n - 1] a(n) = v[n][[1]]

MATHEMATICA

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

CROSSREFS

Cf. A001053.

Sequence in context: A073326 A024203 A073562 this_sequence A054746 A116005 A152390

Adjacent sequences: A121955 A121956 A121957 this_sequence A121959 A121960 A121961

KEYWORD

nonn,uned

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Sep 02 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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research