|
|
A332916
|
|
a(n)/2^A332917(n) is the average number of binary strings of length n with Levenshtein distance <= 3 from a uniform randomly sampled binary string of this length.
|
|
2
|
|
|
8, 31, 461, 815, 5463, 4347, 52813, 76981, 433219, 147811, 3144425, 4087643, 20844159, 13062033, 129023493, 157220577, 757398907, 112836563, 4263247073, 4991221319, 23195548727, 13380878071, 122721139581, 139871649165, 634262649523, 178870288201, 3213642168793
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,1
|
|
COMMENTS
|
Problem posed by user "Anush" in Code Golf Stack Exchange, with a solution by Christian Sievers. See link.
|
|
LINKS
|
|
|
PROG
|
(GAP) See Code Golf Stack Exchange Link.
(PARI) f(n)=(40+6*n-4*n^2)/2^n-83/2+331/12*n-6*n^2+2/3*n^3;
for(k=3, 30, print1(numerator(f(k)), ", "))
(Python)
from fractions import Fraction
def f(n): return Fraction(40+6*n-4*n**2, 2**n) - Fraction(83, 2) + Fraction(331*n, 12) - 6*n**2 + Fraction(2*n**3, 3)
def a(n): return f(n).numerator
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,frac
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|