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!)
A028892 a(n) = Fibonacci(n) - 2^(floor(n/2)). 1
-1, 0, -1, 0, -1, 1, 0, 5, 5, 18, 23, 57, 80, 169, 249, 482, 731, 1341, 2072, 3669, 5741, 9922, 15663, 26609, 42272, 70929, 113201, 188226, 301427, 497845, 799272, 1313501, 2112773, 3459042, 5571815, 9096393 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,8

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..1000

FORMULA

Empirical G.f.: -(x^3-2*x^2-x+1)/((x^2+x-1)*(2*x^2-1)). - Colin Barker, Sep 21 2012

a(n) = A000045(n) - A016116(n). - Michel Marcus, Aug 20 2017

MATHEMATICA

Table[Fibonacci[n] - 2^(Floor[n/2]), {n, 0, 50}] (* G. C. Greubel, Aug 19 2017 *)

PROG

(PARI) for(n=0, 50, print1(fibonacci(n) - 2^(floor(n/2)), ", ")) \\ G. C. Greubel, Aug 19 2017

CROSSREFS

Cf. A000045, A016116.

Sequence in context: A283089 A283142 A303310 * A255448 A255445 A255454

Adjacent sequences:  A028889 A028890 A028891 * A028893 A028894 A028895

KEYWORD

sign

AUTHOR

N. J. A. Sloane

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 27 15:45 EST 2022. Contains 350607 sequences. (Running on oeis4.)