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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002633 Related to discordant permutations.
(Formerly M2384 N0946)
0
1, -3, 5, -3, 9, -3, -51, -675, -5871, -46467, -331371, -1852227, -920295, 224455293, 5571057501, 104877816093, 1781775072801, 28519837563645, 431525731169061, 5994769814117757, 68879336771960361 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

K. Yamamoto, Structure polynomial of Latin rectangles and its application to a combinatorial problem, Memoirs of the Faculty of Science, Kyusyu University, Series A, 10 (1956), 1-13.

LINKS

Table of n, a(n) for n=0..20.

K. Yamamoto, Structure polynomial of Latin rectangles and its application to a combinatorial problem, Memoirs of the Faculty of Science, Kyusyu University, Series A, 10 (1956), 1-13. [Annotated scanned copy]

FORMULA

a(n)-(2n-5)a(n-1)+(n-1)(n-4)a(n-2)+(n-1)(n-2)a(n-3)=0.

MATHEMATICA

a[ n_ ] := a[ n ]=(2n-5)a[ n-1 ]-(n-1)(n-4)a[ n-2 ]-(n-1)(n-2)a[ n-3 ]; a[ 0 ]=1; a[ 1 ]=-3; a[ 2 ]=5; Table[ a[ n ], {n, 0, 24} ]

CROSSREFS

Sequence in context: A199668 A318377 A186203 * A070554 A076842 A077862

Adjacent sequences:  A002630 A002631 A002632 * A002634 A002635 A002636

KEYWORD

sign,easy

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Wouter Meeussen

Typo in Mathematica program fixed by Vaclav Kotesovec, Mar 20 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 14:12 EST 2019. Contains 319225 sequences. (Running on oeis4.)