Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101265
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101265 a(1) = 1, a(2) = 2, a(3) = 6; a(n) = 5*a(n-1) - 5*a(n-2) + a(n-3) for n>3. +0
3
1, 2, 6, 21, 77, 286, 1066, 3977, 14841, 55386, 206702, 771421, 2878981, 10744502, 40099026, 149651601, 558507377, 2084377906, 7779004246, 29031639077, 108347552061, 404358569166, 1509086724602, 5631988329241, 21018866592361 (list; graph; listen)
OFFSET

1,2

COMMENT

Let M = [ 1, 1, 0; 1, 3, 1; 0, 1, 1]; then [1,0,0]*M^n = [a(n), A001353(n), A061278(n-1)] for n>1; Further a(n) = A061278(n) + 1; A001353(n) is first difference of a(n) and first difference of A061278(n). Let v(n) = [1,0,0]*M^n, then sum(v_i(n)) = A001075(n) for n>=0; and v_1(n) + v_3(n) = A001835(n) for n>=0; Characteristic polynomial of M = x^3 - 5x^2 + 5x - 1; a(n)/a(n-1) tends to 2 + sqrt(3) = 3.732.... (see A019973) (a root of the polynomial and an eigenvalue of the matrix).

FORMULA

a(n) = A005246(n)*A005246(n+1). a(n+1) = a(n)*(a(n)+1)/a(n-1). - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Apr 24 2006

a(n) = (A001835(n) + 1) / 2. - Ralf Stephan, May 16 2007

PROGRAM

(PARI) M = [ 1, 1, 0; 1, 3, 1; 0, 1, 1]; for(i=1, 30, print1(([1, 0, 0]*M^i)[1], ", "))

CROSSREFS

Cf. A001353, A061278, A001835, A001075, A019973.

Cf. A005246.

Sequence in context: A116821 A116772 A131792 this_sequence A101879 A101907 A063023

Adjacent sequences: A101262 A101263 A101264 this_sequence A101266 A101267 A101268

KEYWORD

nonn

AUTHOR

Lambert Klasen (lambert.klasen(AT)gmx.net) and Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 25 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