The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A217694 Number of n-variations of the set {1,2,...,n+1} satisfying p(i)-i in {-2,0,2}, i=1..n (an n-variation of the set N_{n+s} = {1,2,...,n+s} is any 1-to-1 mapping p from the set N_n = {1,2,...,n} into N_{n+s} = {1,2,...,n+s}). 8
1, 1, 2, 4, 8, 12, 21, 35, 60, 96, 160, 260, 429, 693, 1134, 1836, 2992, 4840, 7865, 12727, 20648, 33408, 54144, 87608, 141897, 229593, 371722, 601460, 973560, 1575252, 2549421, 4125051, 6675460, 10801120, 17478176, 28280284, 45761045, 74042925, 119808150 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
V. Baltic, Applications of the finite state automata for counting restricted permutations and variations, Yugoslav Journal of Operations Research, 22 (2012), Number 2, 183-198 ; DOI: 10.2298/YJOR120211023B - N. J. A. Sloane, Jan 02 2013
FORMULA
Recurrence: a(n)=a(n-1)+a(n-2)+2*a(n-4)-2*a(n-5)-a(n-6)-a(n-7)-a(n-8).
G.f.: (1+x^3)/(1-x-x^2-2*x^4+2*x^5+x^6+x^7+x^8).
MATHEMATICA
LinearRecurrence[{1, 1, 0, 2, -2, -1, -1, -1}, {1, 1, 2, 4, 8, 12, 21, 35}, 40] (* Harvey P. Dale, Feb 29 2020 *)
CROSSREFS
Sequence in context: A076651 A368986 A081410 * A027677 A103787 A365076
KEYWORD
nonn,easy
AUTHOR
Vladimir Baltic, Oct 11 2012
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 21 09:41 EDT 2024. Contains 372733 sequences. (Running on oeis4.)