|
Search: id:A053565
|
|
|
| A053565 |
|
A second order recursive sequence. |
|
+0
3
|
|
| -2, -1, 4, 20, 64, 176, 448, 1088, 2560, 5888, 13312, 29696, 65536, 143360, 311296, 671744, 1441792, 3080192, 6553600, 13893632, 29360128, 61865984, 130023424, 272629760, 570425344, 1191182336, 2483027968, 5167382528, 10737418240
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 189, 194-196.
|
|
FORMULA
|
a(n)=(2^(n-1))(3n-4).
|
|
EXAMPLE
|
a(n)=4a(n-1)-4a(n-2); a(0)=-2, a(1)=-1.
|
|
CROSSREFS
|
Cf. A023444.
Cf. A027992, A048496.
Adjacent sequences: A053562 A053563 A053564 this_sequence A053566 A053567 A053568
Sequence in context: A013162 A010252 A032105 this_sequence A116603 A015939 A061655
|
|
KEYWORD
|
easy,sign
|
|
AUTHOR
|
Barry E. Williams, Jan 17 2000
|
|
|
Search completed in 0.002 seconds
|
