The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A346586 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A346586

Number of length-n binary words having borders with two mismatches.
(history; published version)

#20 by Jon E. Schoenfield at Sun Apr 17 01:15:38 EDT 2022

STATUS

editing

approved

#19 by Jon E. Schoenfield at Sun Apr 17 01:15:34 EDT 2022

COMMENTS

A word x has a border with two mismatches if there are an equal-length prefix p and suffix s (nonempty, not equal to x, but allowed to overlap) such that the Hamming distance of p and s is exactly two. For example, the English word 'added' has a prefix 'add' and a suffix 'ded' at Hamming distance two.

STATUS

approved

editing

#18 by Michel Marcus at Mon Jul 26 02:31:09 EDT 2021

STATUS

reviewed

approved

#17 by Joerg Arndt at Mon Jul 26 01:41:11 EDT 2021

STATUS

proposed

reviewed

#16 by Michael S. Branicky at Sun Jul 25 14:39:06 EDT 2021

STATUS

editing

proposed

#15 by Michael S. Branicky at Sun Jul 25 14:39:01 EDT 2021

LINKS

S. Klavžar and S. Shpectorov, <a href="https://doi.org/10.1016/j.ejc.2011.10.001">Asymptotic number of isometric generalized Fibonacci cubes</a>, European J. Combin. 33 (2012) 220-226.

#14 by Michael S. Branicky at Sun Jul 25 14:38:17 EDT 2021

LINKS

Michael S. Branicky, <a href="/A346586/b346586.txt">Table of n, a(n) for n = 1..40</a>

Michael S. Branicky, <a href="/A346586/a346586.txt">Python program</a>

PROG

(Python) # see link for faster, bit-based version

STATUS

approved

editing

#13 by Hugo Pfoertner at Sun Jul 25 03:53:44 EDT 2021

STATUS

reviewed

approved

#12 by Joerg Arndt at Sun Jul 25 02:14:07 EDT 2021

STATUS

proposed

reviewed

#11 by Michel Marcus at Sun Jul 25 00:21:58 EDT 2021

STATUS

editing

proposed