Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8474911
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 10, 20262026-06-10T17:45:10+00:00 2026-06-10T17:45:10+00:00

I have been challenged to find the general term or the recurrence relation for

  • 0

I have been challenged to find the general term or the recurrence relation for this sequence

5,18,44,96,195….
The only hint I have is that this sequence is an applied Fibonacci sequence.
Can someone please suggest ways to find the recurrence or the nth term.
I have looked at OEIS but found no note this for this particular integer sequence.
I have searched at numerous locations but have had no success.
Also ,I think the terms of this sequence can be determined in logarithmic time.
Any help will be highly appreciated.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-10T17:45:12+00:00Added an answer on June 10, 2026 at 5:45 pm

    A closed form of the sequence is

    a(n) = (n*Luc(n+6) - 4*Fib(n))/5
    

    where Luc(k) is the k-th Lucas number, and Fib(k) the k-th Fibonacci number. Since Luc(k) = Fib(k+1) + Fib(k-1), the formula can easily be rewritten to use only Fibonacci numbers.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have been set a challenge to create an indexer that takes all words
Have been trying to encrypt an xml file to a string so that I
Have been working on this question for a couple hours and have come close
Have been looking on some tutorials for drawing canvas using SurfaceView, but the only
I have been stuck on this all weekend and failed miserably! Please help me
I have been recently challenged with writing a Windows Service. I needed to periodically
I have posted my 2 source files. I've been trying to find out whats
So recursion is not my strong point, and I have been challenged to make
I have been doing some research on this but found no clear answer. The
So for a lab at uni... Ive been challenged to find all words in

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.