Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102002
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102002 Weighted tribonacci (1,2,4), companion to A102001. +0
2
1, 7, 13, 31, 85, 199, 493, 1231, 3013, 7447, 18397, 45343, 111925, 276199, 681421, 1681519, 4149157, 10237879, 25262269, 62334655, 153810709, 379529095, 936489133 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n)/a(n-1) tends to 2.46750385...an eigenvalue of M and a root of the characteristic polynomial x^3 - x^2 - 2x - 4. A102001 is generated from [1 1 1 / 2 0 0 / 0 2 0] but has the same characteristic polynomial and recursive multipliers (1,2,4). A101000 uses the recursive multipliers (1,2,4,8).

FORMULA

a(n) = a(n-1) + 2*a(n-2) + 4*a(n-3), a>3. a(n) = center term in M^n * [1 1 1], where M = the 3X3 matrix [0 1 0 / 0 0 1 / 4 2 1]; M^n * [1 1 1] = [a(n-1) a(n) a(n+1)].

EXAMPLE

a(6) = 199 = 85 + 2*31 + 4*13 = a(5) + 2*a(4) + 4*a(3).

a(6) = 199 since M^6 * [1 1 1] = [85 199 493] = [a(5) a(6) a(7)].

PROGRAM

sage: from sage.combinat.sloane_functions import recur_gen3 sage: it = recur_gen3(1, 1, 1, 1, 2, 4) sage: [it.next() for i in range(32)] - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 25 2008

CROSSREFS

Cf. A102000, A102001.

Sequence in context: A129781 A040061 A091432 this_sequence A053183 A102903 A026318

Adjacent sequences: A101999 A102000 A102001 this_sequence A102003 A102004 A102005

KEYWORD

nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Dec 23 2004

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 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research