The On-Line Encyclopedia of Bongard Problems

Search: keyword:sequence

Displaying 11-18 of 18 results found.

( prev ) page 1 2

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

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 autobiographical or self-descriptive numbers.`
	REFERENCE	`https://oeis.org/A349595` `https://en.wikipedia.org/wiki/Self-descriptive_number`
	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`

BP1149

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`

BP1197

No sequence is repeated twice in a row vs. some sequence is repeated twice in a row.

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

	REFERENCE	`https://en.wikipedia.org/wiki/Square-free_word`
	CROSSREFS	`Adjacent-numbered pages: BP1192 BP1193 BP1194 BP1195 BP1196 * BP1198 BP1199 BP1200 BP1201 BP1202`
	KEYWORD	`precise, allsorted, notso, left-narrow, sequence, traditional, preciseworld, dithering, left-listable`
	CONCEPT	`two (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP1268

Palindromic when elements are grouped into (more than one) equal-sized blocks vs. no grouping of elements into (more than one) equal-sized blocks is palindromic.

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

	COMMENTS	`Any palindrome would be sorted left, except strings of length zero or one.`
	CROSSREFS	`Adjacent-numbered pages: BP1263 BP1264 BP1265 BP1266 BP1267 * BP1269 BP1270 BP1271 BP1272 BP1273`
	KEYWORD	`precise, allsorted, unwordable, notso, sequence, traditional, miniworlds`
	CONCEPT	`element_wise_symmetry (info \| search),` `element_grouping (info \| search),` `sequence (info \| search),` `same_shape (info \| search),` `same (info \| search)`
	WORLD	`[smaller \| same \| bigger] zoom in left \| zoom in right`
	AUTHOR	`Leo Crabbe`

BP1273

Sequence contains each possible way its distinct elements can be arranged as a subsequence vs. not so.

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

	REFERENCE	`https://en.wikipedia.org/wiki/Superpermutation`
	CROSSREFS	`Adjacent-numbered pages: BP1268 BP1269 BP1270 BP1271 BP1272 * BP1274 BP1275 BP1276 BP1277 BP1278`
	EXAMPLE	`There are 6 ways of arranging the letters A, B and C: ABC, ACB, BAC, BCA, CAB, and CBA. The string "ABCABACBA" contains each of these as a substring, and would therefore be sorted left.`
	KEYWORD	`precise, allsorted, notso, sequence, traditional, miniworlds`
	CONCEPT	`sequence (info \| search),` `overlap (info \| search)`
	WORLD	`[smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

BP1274

Reversing the sequence permutes the objects vs. not.

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

	COMMENTS	`Equivalently, some permutation of the objects reverses the sequence vs. not.` `Palindromes fit left. Strings of distinct objects repeated any number of times fit left.`
	CROSSREFS	`Adjacent-numbered pages: BP1269 BP1270 BP1271 BP1272 BP1273 * BP1275 BP1276 BP1277 BP1278 BP1279`
	KEYWORD	`nice, precise, allsorted, notso, sequence, miniworlds`
	WORLD	`[smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP1275

There is a way of grouping elements into (more than one) equal-sized blocks such that no block appears twice vs. there exists no such grouping.

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

	COMMENTS	`Sequences with a prime number of elements are sorted left when all their elements are unique, and sorted right otherwise.`
	CROSSREFS	`Adjacent-numbered pages: BP1270 BP1271 BP1272 BP1273 BP1274 * BP1276 BP1277 BP1278 BP1279 BP1280`
	EXAMPLE	`The sequence ABBABB would be sorted left, as it could be grouped into (AB)(BA)(BB), where each block is unique.`
	KEYWORD	`precise, unwordable, notso, sequence, miniworlds`
	CONCEPT	`element_grouping (info \| search)`
	AUTHOR	`Leo Crabbe`

BP1276

Ways of representing the sequence "ABABCBACCBAC" by grouping its elements into equal-sized blocks and relabelling them (identical blocks are represented by the same element) vs. representations of different sequences.

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

	COMMENTS	`The solver isn't expected to word their solution as it is put above, but to notice that the sequences on the left all "agree" with each other under the aforementioned grouping rule. The 12-element sequence in EX10249 can be "squashed down" into the 6-element sequence in EX10251, which in turn can be "squashed down" into the 3-element sequence in EX10252.`
	CROSSREFS	`Compare to BP121` `Adjacent-numbered pages: BP1271 BP1272 BP1273 BP1274 BP1275 * BP1277 BP1278 BP1279 BP1280 BP1281`
	KEYWORD	`unwordable, notso, arbitrary, sequence`
	CONCEPT	`element_grouping (info \| search)`
	AUTHOR	`Leo Crabbe`

( prev ) page 1 2

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