Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A342239

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Table read by upward antidiagonals: T(n,k) is the number of strings of length k over an n-letter alphabet that are bifix free; n >= 1, k >= 1.
(history; published version)
#22 by Michael De Vlieger at Mon Apr 18 12:31:22 EDT 2022
STATUS

reviewed

approved

#21 by Joerg Arndt at Mon Apr 18 10:43:54 EDT 2022
STATUS

proposed

reviewed

#20 by Pontus von Brömssen at Mon Apr 18 10:11:02 EDT 2022
STATUS

editing

proposed

#19 by Pontus von Brömssen at Mon Apr 18 10:10:32 EDT 2022
NAME

Table read by upward antidiagonals: T(n,k) is the number of strings of length k over a an n-letter alphabet that are bifix free; n >= 1, k >= 1.

STATUS

approved

editing

#18 by Alois P. Heinz at Sun Mar 07 20:56:11 EST 2021
STATUS

proposed

approved

#17 by Peter Kagey at Sun Mar 07 20:46:35 EST 2021
STATUS

editing

proposed

#16 by Peter Kagey at Sun Mar 07 20:44:50 EST 2021
KEYWORD

nonn,new,tabl

STATUS

approved

editing

#15 by N. J. A. Sloane at Sun Mar 07 17:42:00 EST 2021
STATUS

proposed

approved

#14 by Peter Kagey at Sun Mar 07 17:35:18 EST 2021
STATUS

editing

proposed

#13 by Peter Kagey at Sun Mar 07 17:35:14 EST 2021
LINKS

Peter Kagey, <a href="/A342239/b342239.txt">Table of n, a(n) for Antidiagonals n = 1..5050100, flattened</a>

STATUS

proposed

editing