OFFSET
0,3
COMMENTS
Number of permutations of 1..n such that each position is fixed or moves to an adjacent position (with n considered adjacent to 1). For example, a(4) = 9 because there is the identity; 2 cyclic permutations; 4 swaps of one pair of adjacent entries; and 2 swaps of two pairs of adjacent entries. - Joshua Zucker, Nov 13 2003
REFERENCES
Lehmer, D. H.; Permutations with strongly restricted displacements. Combinatorial theory and its applications, II (Proc. Colloq., Balatonfured, 1969), pp. 755-770. North-Holland, Amsterdam, 1970.
LINKS
Index entries for linear recurrences with constant coefficients, signature (2, 0, -1).
FORMULA
For n>4, a(n) = a(n-1) + a(n-2) - 2. - Joshua Zucker, Nov 13 2003
a(n) = Fibonacci(n+1) + Fibonacci(n-1) + 2, for n>2. - Jessa Lee (jessal(AT)comcast.net), Nov 25 2003
For n > 2, a(n)=A001610(n-1) - 3. - Toby Gottfried, Apr 13 2013
MATHEMATICA
CoefficientList[Series[(1-x+3x^3-2x^4-3x^5)/(1-2x+x^3), {x, 0, 40}], x] (* or *) Join[{1, 1, 2}, #[[3]]+#[[1]]+2&/@Partition[Fibonacci[Range[2, 50]], 3, 1]] (* Harvey P. Dale, Apr 06 2017 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Second formula corrected by David Radcliffe, Jan 16 2011
STATUS
approved