
3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

For n >= 0, let M(n) be the matrix with first row = (n n+1) and 2nd row = (n+3 n+5). Then a(n) = det(M(n)). [From K.V.Iyer, Apr 11 2009]


LINKS

Table of n, a(n) for n=0..58.
Tanya Khovanova, Recursive Sequences
Robert G. Wilson v, American English names for the numbers from 0 to 100999 without spaces or hyphens.
Index entries for linear recurrences with constant coefficients, signature (2,1).


FORMULA

a(n) = 2 a(n1)  a(n2). a(n) = A022959(n). G.f.: (3 + 4*x)/(1  x)^2.  M. F. Hasler, Apr 18 2015


PROG

(PARI) a(n)=n3


CROSSREFS

Cf. A256958, A001057, A000027, A001477, A023443, A023444, A023446, ..., A023482, A022958, ..., A022996.
Sequence in context: A194703 A219175 A022959 * A068494 A200726 A195040
Adjacent sequences: A023442 A023443 A023444 * A023446 A023447 A023448


KEYWORD

sign,easy


AUTHOR

N. J. A. Sloane.


STATUS

approved

