login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023445 n-3. 0
-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; 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 Kailasam Viswanathan Iyer (kvi(AT)nitt.edu), Apr 11 2009]

LINKS

Tanya Khovanova, Recursive Sequences

Robert G. Wilson v, American English names for the numbers from 0 to 100999 without spaces or hyphens.

Index to sequences with linear recurrences with constant coefficients, signature (2,-1).

PROG

(PARI) a(n)=n-3

CROSSREFS

Sequence in context: A062160 A194703 A022959 * A068494 A195040 A083721

Adjacent sequences:  A023442 A023443 A023444 * A023446 A023447 A023448

KEYWORD

sign,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.