|
| |
|
|
A053565
|
|
A second order recursive sequence.
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
REFERENCES
| A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 189, 194-196.
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..2000
|
|
|
FORMULA
| a(n) = (2^(n-1))*(3*n-4).
a(n) = 4*a(n-1)-4*a(n-2); a(0)=-2, a(1)=-1.
|
|
|
PROG
| (MAGMA) [(2^(n-1))*(3*n-4) : n in [0..30]]; // Vincenzo Librandi, Sep 26 2011
|
|
|
CROSSREFS
| Cf. A023444.
Cf. A027992, A048496.
Sequence in context: A013162 A010252 A032105 * A116603 A158356 A015939
Adjacent sequences: A053562 A053563 A053564 * A053566 A053567 A053568
|
|
|
KEYWORD
| sign,easy
|
|
|
AUTHOR
| Barry E. Williams, Jan 17 2000
|
| |
|
|
