A140259 -id:A140259 - cp's OEIS frontend

A140260 Those n for which A140259(n) = A002264(n+11).

0, 4, 10, 19, 33, 54, 85, 132, 202, 307, 465, 702, 1057, 1590, 2389, 3588, 5386, 8083, 12129, 18198, 27301, 40956, 61438, 92161, 138246, 207373, 311064, 466600, 699904, 1049860, 1574794, 2362195, 3543297, 5314950, 7972429, 11958648

Offset: 0

Antti Karttunen, May 16 2008, based on the 2008 postings by Nicolau Leal Werneck (nwerneck(AT)gmail.com)

nonn

These are the iterations where the knot comes to the front of the necklace in Werneck's Black Pearl Necklace problem.

Nicolau Werneck, Adaptoide, a library for adaptive finite automata. Source code in C++ available.
Nicolau Werneck, The Black Pearl Necklace, description of the problem.
Nicolau Werneck, et al. Discussion on the NKS Forum

Cf. A134342, A140261, A140262.

A140261 The length of Sapro's necklace at successive years in Werneck's Black Pearl Necklace problem.

Original entry on oeis.org

3, 5, 7, 10, 14, 21, 32, 47, 71, 106, 158, 237, 356, 533, 800, 1199, 1799, 2698, 4046, 6069, 9104, 13655, 20483, 30724, 46085, 69128, 103691, 155537, 233305, 349957, 524935, 787402, 1181102, 1771653, 2657480, 3986219, 5979329, 8968993

Offset: 0

Antti Karttunen, May 16 2008, based on the 2008 postings by Nicolau Leal Werneck (nwerneck(AT)gmail.com)

nonn

Nicolau Werneck, Adaptoide, a library for adaptive finite automata. Source code in C++ available.
Nicolau Werneck, The Black Pearl Necklace, description of the problem.
Nicolau Werneck, et al. Discussion on the NKS Forum

a(n) = A140259(A140260(n)). Cf. A134342.

cp's OEIS Frontend

A140260 Those n for which A140259(n) = A002264(n+11).

Views

Author

Keywords

Comments

Links