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

Home > Numbers
Descriptor Sequence #2 (Posted on 2024-06-07) Difficulty: 3 of 5
Refer to Descriptor Sequence.

The descriptor sequence is a sequence of numbers in which the digits of each number describe the preceding number. The first number is 1. This number consists of one 1, so the second number is 11 (that is, one-one). This consists of two 1's, so the third term is 21. This consists of one 2 and one 1, so the fourth term is 1211. The first six numbers in the sequence are:
1, 11, 21, 1211, 111221, 312211.

Prove that the string 13113 never occurs.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
There are no comments yet.
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:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information