The On-Line Encyclopedia of Bongard Problems

Search: keyword:sequence

Displaying 1-6 of 6 results found.

page 1

Sort: id Format: long Filter: (all | no meta | meta) Mode: (words | no words)

Numbers of dots in ascending order from left to right vs. numbers of dots neither in ascending nor descending order from left to right.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Adjacent-numbered pages: BP921 BP922 BP923 BP924 BP925 * BP927 BP928 BP929 BP930 BP931`
	KEYWORD	`nice, math, sequence, traditional, left-listable, right-listable`
	CONCEPT	`number (info \| search),` `dot (info \| search)`
	WORLD	`dot_clusters_sequence_horizontal [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

Some number labels its own position in the sequence from left to right vs. not so.

(edit; present; nest [left/right]; search; history)

	COMMENTS	`Right examples are called "derangements".`
	CROSSREFS	`Adjacent-numbered pages: BP926 BP927 BP928 BP929 BP930 * BP932 BP933 BP934 BP935 BP936`
	KEYWORD	`handed, leftright, sequence, traditional, left-listable, right-listable`
	CONCEPT	`number (info \| search),` `dot (info \| search),` `self-reference (info \| search)`
	WORLD	`dot_clusters_sequence_horizontal [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

Nested pairs of brackets vs. other arrangement of brackets (some open brackets are not closed or there are extra closing brackets).

(edit; present; nest [left/right]; search; history)

	COMMENTS	`Examples on the left are also known as "Dyck words".`
	REFERENCE	`https://en.wikipedia.org/wiki/Dyck_language`
	CROSSREFS	`Adjacent-numbered pages: BP951 BP952 BP953 BP954 BP955 * BP957 BP958 BP959 BP960 BP961`
	KEYWORD	`easy, nice, precise, allsorted, unwordable, notso, sequence, traditional, inductivedefinition, preciseworld, left-listable, right-listable`
	CONCEPT	`recursion (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

Palindromes vs. not palindromes.

(edit; present; nest [left/right]; search; history)

	COMMENTS	`All examples in this Problem are sequences of graphic symbols. In this Problem, a "palindrome" is taken to be an ordered sequence which is the same read left-to-right as it is read right-to-left. A more formal solution to this Problem could be: "Sequences which are invariant under a permutation which swaps first and last entries, second and second last entries, third and third last entries, ... and so on vs. sequences which are not invariant under the aforementioned permutamation."`
	CROSSREFS	`Adjacent-numbered pages: BP981 BP982 BP983 BP984 BP985 * BP987 BP988 BP989 BP990 BP991`
	KEYWORD	`nice, precise, allsorted, notso, sequence, traditional`
	CONCEPT	`element_wise_symmetry (info \| search),` `identical (info \| search),` `sequence (info \| search),` `same_shape (info \| search),` `same (info \| search),` `symmetry (info \| search)`
	AUTHOR	`Jago Collins`

Number of dots in the Nth box (from the left) is how many times the number (N - 1) appears in the whole diagram vs. not so.

(edit; present; nest [left/right]; search; history)

	COMMENTS	`Left-sorted examples are sometimes called self-descriptive sequences.`
	CROSSREFS	`See BP1147 for a similar idea.` `BP1149 was inspired by this.` `Adjacent-numbered pages: BP1143 BP1144 BP1145 BP1146 BP1147 * BP1149 BP1150 BP1151 BP1152 BP1153`
	KEYWORD	`nice, precise, unwordable, notso, handed, leftright, left-narrow, sequence, preciseworld, left-listable, right-listable`
	CONCEPT	`self-reference (info \| search)`
	AUTHOR	`Leo Crabbe`

Number in the Nth box (from the left) is how many numbers appear N times vs. not so.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Inspired by BP1148.` `Adjacent-numbered pages: BP1144 BP1145 BP1146 BP1147 BP1148 * BP1150 BP1151 BP1152 BP1153 BP1154`
	KEYWORD	`nice, precise, unwordable, notso, handed, leftright, left-narrow, sequence, preciseworld, left-listable, right-listable`
	CONCEPT	`self-reference (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

page 1

		Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)