# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/
Search: id:a214943
Showing 1-1 of 1
%I A214943 #22 Jul 09 2024 19:42:09
%S A214943 2,3,2,4,6,2,5,12,12,0,6,20,36,18,0,7,30,80,96,30,0,8,42,150,300,264,
%T A214943 42,0,9,56,252,720,1140,696,60,0,10,72,392,1470,3480,4260,1848,78,0,
%U A214943 11,90,576,2688,8610,16680,15960,4848,108,0,12,110,810,4536,18480,50190,80040
%N A214943 T(n,k) = Number of squarefree words of length n in a (k+1)-ary alphabet.
%C A214943 Table starts
%C A214943 .2..3...4....5.....6.....7......8......9.....10......11......12......13......14
%C A214943 .2..6..12...20....30....42.....56.....72.....90.....110.....132.....156.....182
%C A214943 .2.12..36...80...150...252....392....576....810....1100....1452....1872....2366
%C A214943 .0.18..96..300...720..1470...2688...4536...7200...10890...15840...22308...30576
%C A214943 .0.30.264.1140..3480..8610..18480..35784..64080..107910..172920..265980..395304
%C A214943 .0.42.696.4260.16680.50190.126672.281736.569520.1068210.1886280.3169452.5108376
%C A214943 Empirical: row n is a polynomial of degree n
%C A214943 Coefficients for rows 1-12, highest power first:
%C A214943 ...1...1
%C A214943 ...1...1...0
%C A214943 ...1...1...0...0
%C A214943 ...1...1..-1..-1...0
%C A214943 ...1...1..-2..-1...1...0
%C A214943 ...1...1..-3..-2...2...1...0
%C A214943 ...1...1..-4..-3...5...2..-2...0
%C A214943 ...1...1..-5..-4...8...4..-4..-1...0
%C A214943 ...1...1..-6..-5..12...8..-9..-4...2...0
%C A214943 ...1...1..-7..-6..17..12.-17..-7...6...0...0
%C A214943 ...1...1..-8..-7..23..17.-28.-13..10...2...2...0
%C A214943 ...1...1..-9..-8..30..23.-45.-23..25...3..-2...4...0
%C A214943 Terms in column k are multiples of k+1 due to symmetry. - _Michael S. Branicky_, May 20 2021
%H A214943 R. H. Hardin, Table of n, a(n) for n = 1..245
%H A214943 A. M. Shur, Growth of Power-Free Languages over Large Alphabets, CSR 2010, LNCS vol. 6072, 350-361.
%H A214943 A. M. Shur, Numerical values of the growth rates of power-free languages, arXiv:1009.4415 [cs.FL], 2010.
%F A214943 From _Arseny Shur_, Apr 26 2015: (Start)
%F A214943 Let L_k be the limit lim T(n,k)^{1/n}, which exists because T(n,k) is a submultiplicative sequence for any k. Then L_k=k-1/k-1/k^3-O(1/k^5) (Shur, 2010).
%F A214943 Exact values of L_k for small k, rounded up to several decimal places:
%F A214943 L_2=1.30176..., L_3=2.6215080..., L_4=3.7325386... (for L_5,...,L_14 see Shur arXiv:1009.4415).
%F A214943 Empirical observation: for k=2 the O-term in the general formula is slightly bigger than 2/k^5, and for k=3,...,14 this O-term is slightly smaller than 2/k^5.
%F A214943 (End)
%e A214943 Some solutions for n=6 k=4
%e A214943 ..0....1....1....0....4....4....4....0....2....2....1....2....1....4....1....1
%e A214943 ..2....0....4....4....3....0....0....4....1....3....4....0....0....2....0....3
%e A214943 ..1....4....2....1....2....3....2....1....0....4....3....2....2....1....2....1
%e A214943 ..4....3....4....2....3....1....4....2....4....1....2....4....4....3....4....4
%e A214943 ..1....0....3....0....0....4....2....3....2....0....1....3....0....4....2....3
%e A214943 ..0....2....1....3....1....0....3....1....4....4....0....0....1....3....0....1
%o A214943 (Python)
%o A214943 from itertools import product
%o A214943 def T(n, k):
%o A214943 if n == 1: return k+1
%o A214943 symbols = "".join(chr(48+i) for i in range(k+1))
%o A214943 squares = ["".join(u)*2 for r in range(1, n//2 + 1)
%o A214943 for u in product(symbols, repeat = r)]
%o A214943 words = ("0" + "".join(w) for w in product(symbols, repeat=n-1))
%o A214943 return (k+1)*sum(all(s not in w for s in squares) for w in words)
%o A214943 def atodiag(maxd): # maxd antidiagonals
%o A214943 return [T(n, d+1-n) for d in range(1, maxd+1) for n in range(1, d+1)]
%o A214943 print(atodiag(11)) # _Michael S. Branicky_, May 20 2021
%Y A214943 Cf. A006156 (column 2), A051041 (column 3), A214939 (column 4).
%Y A214943 Cf. A002378 (row 2), A011379 (row 3), A047929(n+1) (row 4).
%K A214943 nonn,tabl
%O A214943 1,1
%A A214943 _R. H. Hardin_, Jul 30 2012
# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE