[1, 2, 3, 4, 5, 6]

A sequential list of increasing integers from one to six.

MathSequenceDataNumerical

Complexity

Current best complexity is 112:

[1, 2, 3, 4, 5, 6]
112
Discover this myself!

Statistics

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

Highlights

  1. First discovered by
    Hello5184's board
    · 1 hour ago
  2. Lowest complexity112first 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

Recursion
Null
Binary
Bit
Hexagon
Byte
Octet
Triangle
Log
Alphabetical Order
Pipeline
Alphanumeric

Technical information

Concept ID
250605
Color
#4a90e2
Emoji
🔢/123️⃣
Categories
Math, Sequence, Data, Numerical
Best complexity
112
First discovered
Jun 24, 2026, 13:58 UTC
Trademarked
No
Copyrighted
No

About "[1, 2, 3, 4, 5, 6]" concept

[1, 2, 3, 4, 5, 6] can be discovered in Concepts, categorized under Math, Sequence, Data, Numerical. A sequential list of increasing integers from one to six.

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

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

Related concepts worth exploring include Recursion, Null, Binary, Bit, Hexagon, Byte, and 6 more.

[1, 2, 3, 4, 5, 6] 🔢 | Concepts