Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002633
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002633 Related to discordant permutations.
(Formerly M2384 N0946)
+0
1
1, -3, 5, -3, 9, -3, -51, -675, -5871, -46467, -331371, -1852227, -920295, 224455293, 5571057501, 104877816093, 1781775072801, 28519837563645, 431525731169061, 5994769814117757, 68879336771960361 (list; graph; listen)
OFFSET

0,2

REFERENCES

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

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (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.

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[ s[ n ], {n, 0, 24} ]

CROSSREFS

Sequence in context: A100338 A094444 A099446 this_sequence A070554 A076842 A077862

Adjacent sequences: A002630 A002631 A002632 this_sequence A002634 A002635 A002636

KEYWORD

sign,easy

AUTHOR

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

EXTENSIONS

More terms from wouter.meeussen(AT)pandora.be

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research