|
Search: id:A095796
|
|
|
| A095796 |
|
A recursive sequence generated from Pascal's triangle terms. |
|
+0
1
|
|
| 1, 26, 98, 238, 467, 806, 1276, 1898, 2693, 3682, 4886, 6326, 8023, 9998, 12272, 14866, 17801, 21098, 24778, 28862, 33371, 38326, 43748, 49658, 56077, 63026, 70526, 78598, 87263, 96542, 106456
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
1. Use recursion multipliers (n>4): (4), (-6), (4), (-1); i.e. a(n+4) = 4*a(n+3) - 6*a(n+2) + 4*a(n+1) - a(n). 2. Let M = the 4 X 4 matrix [1 0 0 0 / 1 1 0 0 / 2 3 1 0 / 6 12 7 1]. Then M^n * [1 1 1 1] = [ 1 (n+1) A095794(n), a(n)]
|
|
EXAMPLE
|
1. 1276 = a(6) = 4*a(5) - 6*a(4) + 4*a(3) - a(2) = 4*806 - 6*467 + 4*238 - 98.
2. 806 = a(5) since M65 * [1 1 1 1] = [1 6 56 806] where 56 = A095794(5).
|
|
CROSSREFS
|
Cf. A095794.
Sequence in context: A044594 A038654 A010014 this_sequence A159541 A144129 A026915
Adjacent sequences: A095793 A095794 A095795 this_sequence A095797 A095798 A095799
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 06 2004
|
|
|
Search completed in 0.002 seconds
|
