A pea pattern is a mathematical pattern that, when following certain steps, will yield an infinite or near-infinite string of patterned numbers. The first-ever pea pattern made goes as such: A number is first named, such as and the next number is derived by how many of each digit is named in the number. There is one digit in and there are of that number, so the next number is . There are two 's in thus the next number in the series is 2. There is 2 and in 2 so the number after that is .

PropertyValue
dbpprop:abstract
  • A pea pattern is a mathematical pattern that, when following certain steps, will yield an infinite or near-infinite string of patterned numbers. The first-ever pea pattern made goes as such: A number is first named, such as and the next number is derived by how many of each digit is named in the number. There is one digit in and there are of that number, so the next number is . There are two 's in thus the next number in the series is 2. There is 2 and in 2 so the number after that is . 2 The second pea pattern is somewhat unique in that it goes backwards, beginning with a large number and going back down to a one-digit number. One could begin with a number such as . The adjacent numbers are subtracted from one another, as such: Using this method the numbers will usually retract to .
dbpprop:hasPhotoCollection
rdf:type
rdfs:comment
  • A pea pattern is a mathematical pattern that, when following certain steps, will yield an infinite or near-infinite string of patterned numbers. The first-ever pea pattern made goes as such: A number is first named, such as and the next number is derived by how many of each digit is named in the number. There is one digit in and there are of that number, so the next number is . There are two 's in thus the next number in the series is 2. There is 2 and in 2 so the number after that is .
rdfs:label
  • Pea pattern
owl:sameAs
skos:subject
foaf:page
is dbpprop:redirect of
is owl:sameAs of