|
Search: id:A120689
|
|
|
| A120689 |
|
a(n) = 10*a(n-1) - 16*a(n-2), n>0. |
|
+0 5
|
|
| 0, 3, 30, 252, 2040, 16368, 131040, 1048512, 8388480, 67108608, 536870400, 4294966272, 34359736320, 274877902848, 2199023247360, 17592186028032, 140737488322560, 1125899906777088, 9007199254609920, 72057594037665792
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n) + A081342(n) = 8^n; e.g. a(4) + A081342(4) = 2040 + 2056 = 4096 = 8^4.
a(n) is a leg in a Pythagorean triangle along with A081342(n) (the hypotenuse) and 4^n. Example: a(4) = 2040, A081342(4) = 2056; then sqrt(2056^2 - 2040^2) = 256 = 4^4. Characteristic polynomial of M = x^2 -10x + 16.
Order of modular group of degree 2^(n-1)+1 - Artur Jasinski (grafix(AT)csl.pl), Aug 04 2007
|
|
REFERENCES
|
E. Mathieu, Memoire sur la nombre de valeurs que peut acquirer une fonction quand on y permut ses variables de toutes les maniers possibles, Journ. de math. (2) 5 (1860), 9-42 (see p. 39).
|
|
FORMULA
|
Given M = 2 X 2 matrix [5,3; 3,5]; M^n * [1,0] = [A081342(a), a(n)]. E.g. a(4) = 2040, right term in = M^4 * [1,0] = [2056, 2040] = [A081342(4), a(4)].
a(n) = (2^(n-2))*(2^(2n-2)-1). - Artur Jasinski (grafix(AT)csl.pl), Aug 04 2007
|
|
MAPLE
|
a[0]:=0: a[1]:=3; for n from 2 to 20 do a[n]:=10*a[n-1]-16*a[n-2] end do: seq(a[n], n = 0 .. 20); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 16 2007
seq(binomial(2^n, 2)*(2^n + 1), n=0..19); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 07 2008
|
|
MATHEMATICA
|
Table[2^(x - 2) (2^(2 x - 2) - 1), {x, 1, 15}] - Artur Jasinski (grafix(AT)csl.pl), Aug 04 2007
|
|
CROSSREFS
|
Cf. A081342.
Cf. A016131.
Sequence in context: A130546 A051133 A043030 this_sequence A136896 A121085 A144282
Adjacent sequences: A120686 A120687 A120688 this_sequence A120690 A120691 A120692
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 25 2006
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com) at the suggestion of Andrew Plewe, Jul 13 2007
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 16 2007
|
|
|
Search completed in 0.002 seconds
|