All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
No consecutive 1's (Posted on 2022-02-27) Difficulty: 3 of 5
In how many ways can n be written as the sum of positive integers with no consecutive 1's?

For example a(4)=5 because we have (4)=(1+3)=(2+2)=(3+1)=(1+2+1)

Prove the sequence defined by a(n).

No Solution Yet Submitted by Jer    
Rating: 5.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionSolutionBrian Smith2022-03-01 11:54:10
Some Thoughtsanswer--no proofCharlie2022-02-27 10:42:06
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information