perplexus.info :: Sequences : Sequence Count Conclusion

Sequence Count Conclusion (Posted on 2015-10-13)

How many 15-letter sequences are there which use only A, B, C and D (and not necessarily all of those), where:
A is never immediately followed by B, B is never immediately followed by C, C is never immediately followed by D and D is never immediately followed by A?

Submitted by K Sengupta

Rating: 5.0000 (1 votes)

Solution: (Hide)

The required number of sequences is 19,131,876.
For an explanation, refer to the solution submitted by Steve Herman in this location.

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
re: AAAAAAAAAAAAAAA (spoiler)	K Sengupta	2024-04-25 08:28:26
AAAAAAAAAAAAAAA (spoiler)	Steve Herman	2015-10-13 08:55:36

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (1)
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:


perplexus dot info