[0, 1, 1, 2, 3, 5]

The first six numbers of the Fibonacci integer sequence.

MathSequenceNumbersAlgorithm

Complexity

Current best complexity is 115:

[0, 1, 1, 2, 3, 5]
115
Discover this myself!

Statistics

Discovered by
1board
Best recipe held by
1board
First discovered
1 hourago
Crafted
3times
Made with
2recipes
Used in
9recipes

Highlights

  1. First discovered by
    Hello5184's board
    · 1 hour ago
  2. Lowest complexity115first held by
    Hello5184's board
    · 1 hour ago
  3. Last crafted by
    Hello5184's board
    · 1 hour ago
  4. Last used in a recipe by
    Hello5184's board
    · 1 hour ago

Related concepts

Infinite Loop
Recursion
Mathematics
Hexagon
Triangle
First
Timeline
Arithmetic
Chronology
Oval
Countdown
Cycle

Technical information

Concept ID
250611
Color
#3a6275
Emoji
🔢
Categories
Math, Sequence, Numbers, Algorithm
Best complexity
115
First discovered
Jun 24, 2026, 13:59 UTC
Trademarked
No
Copyrighted
No

About "[0, 1, 1, 2, 3, 5]" concept

[0, 1, 1, 2, 3, 5] can be discovered in Concepts, categorized under Math, Sequence, Numbers, Algorithm. The first six numbers of the Fibonacci integer sequence.

It has been discovered by 1 board and crafted 3 times, first appearing 1 hour ago. [0, 1, 1, 2, 3, 5] can be created from 2 recipes, and goes on to appear as an ingredient in 9 others.

[0, 1, 1, 2, 3, 5] was first discovered by Hello5184's board 1 hour ago. They also hold the lowest-complexity recipe, at 115.

Related concepts worth exploring include Infinite Loop, Recursion, Mathematics, Hexagon, Triangle, First, and 6 more.

[0, 1, 1, 2, 3, 5] 🔢 | Concepts