This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A260259 a(n) = F(n)*F(n+1) - (-1)^n, where F = A000045. 3
 -1, 2, 1, 7, 14, 41, 103, 274, 713, 1871, 4894, 12817, 33551, 87842, 229969, 602071, 1576238, 4126649, 10803703, 28284466, 74049689, 193864607, 507544126, 1328767777, 3478759199, 9107509826, 23843770273, 62423800999, 163427632718, 427859097161, 1120149658759 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Primes in sequence for n = 1, 3, 5, 6, 9, 24, 42, 48, 53, 71, 86, 102, 138, 182, 302, 438, 506, 926, ... LINKS Bruno Berselli, Table of n, a(n) for n = 0..500 A. Bremner, R. Høibakk, D. Lukkassen, Crossed ladders and Euler’s quartic, Annales Mathematicae et Informaticae, 36 (2009) pp. 29-41. See p. 33. Index entries for linear recurrences with constant coefficients, signature (2,2,-1). FORMULA G.f.: (-1 + 4*x - x^2)/((1 + x)*(1 - 3*x + x^2)). a(n) = -a(-n-1) = 2*a(n-1) + 2*a(n-2) - a(n-3) for all n in Z. a(n) = F(n+2)^2 - 2*F(n+1)^2. a(n) = A059929(n) - A059929(n-1) with A059929(-1)=1. a(n) = -A001654(n+1) + 4*A001654(n) - A001654(n-1). a(n) = A206351((n+2)/2)-2 for even n; a(n) = A003482((n-1)/2)+2 for odd n. Sum_{i>=0} 1/a(i) = .754301907697893871765121109686... a(n) = (2^(-1-n)*(-3*(-1)^n*2^(2+n)-(3-sqrt(5))^n*(-1+sqrt(5))+(1+sqrt(5))*(3+sqrt(5))^n))/5. - Colin Barker, Sep 29 2016 MAPLE with(combinat): A260259:=n->fibonacci(n)*fibonacci(n+1)-(-1)^n: seq(A260259(n), n=0..50); # Wesley Ivan Hurt, Feb 04 2017 MATHEMATICA Table[Fibonacci[n] Fibonacci[n + 1] - (-1)^n, {n, 0, 30}] PROG (PARI) for(n=0, 30, print1(fibonacci(n)*fibonacci(n+1)-(-1)^n", ")); (PARI) a(n) = round((2^(-1-n)*(-3*(-1)^n*2^(2+n)-(3-sqrt(5))^n*(-1+sqrt(5))+(1+sqrt(5))*(3+sqrt(5))^n))/5) \\ Colin Barker, Sep 29 2016 (PARI) Vec(-(1-4*x+x^2)/((1+x)*(1-3*x+x^2)) + O(x^30)) \\ Colin Barker, Sep 29 2016 (Sage) [fibonacci(n)*fibonacci(n+1)-(-1)^n for n in (0..30)] (Maxima) makelist(fib(n)*fib(n+1)-(-1)^n, n, 0, 30); (MAGMA) [Fibonacci(n)*Fibonacci(n+1)-(-1)^n: n in [0..30]]; CROSSREFS First bisection of A111569. Cf. A226205: numbers of the form F(n)*F(n+1)+(-1)^n. Cf. A000045, A001654, A003482, A059929, A089508 (first bisection, without -1), A206351. Sequence in context: A272931 A095137 A239104 * A141488 A113042 A305881 Adjacent sequences:  A260256 A260257 A260258 * A260260 A260261 A260262 KEYWORD sign,easy AUTHOR Bruno Berselli, Oct 31 2015 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.

Last modified September 20 21:09 EDT 2019. Contains 327247 sequences. (Running on oeis4.)