login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214940 Number of squarefree words of length n in a 6-ary alphabet 0

%I #8 Jun 30 2021 07:44:43

%S 6,30,150,720,3480,16680,80040,383520,1838160,8807400,42202560,

%T 202209720,968880960,4642304520,22243228680,106576361760,510651000360

%N Number of squarefree words of length n in a 6-ary alphabet

%C Column 5 of A214943

%e Some solutions for n=6

%e ..4....4....4....1....5....5....4....5....2....1....5....4....2....1....4....5

%e ..0....5....5....4....2....4....1....1....1....3....3....1....4....2....1....2

%e ..5....3....0....5....3....2....4....4....0....1....4....0....3....0....2....1

%e ..3....4....3....3....2....5....2....5....5....4....0....3....5....4....4....0

%e ..5....1....4....5....1....3....3....3....2....5....3....4....0....2....5....5

%e ..0....0....5....2....3....4....2....5....3....2....4....2....2....4....1....1

%o (Python)

%o from itertools import product

%o def a(n):

%o if n == 1: return 6

%o squares = ["".join(u) + "".join(u)

%o for r in range(1, n//2 + 1) for u in product("012345", repeat=r)]

%o words = ("0"+"".join(w) for w in product("012345", repeat=n-1))

%o return 6*sum(all(s not in w for s in squares) for w in words)

%o print([a(n) for n in range(1, 9)]) # _Michael S. Branicky_, Jun 30 2021

%K nonn

%O 1,1

%A _R. H. Hardin_ Jul 30 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 14 01:00 EDT 2024. Contains 375146 sequences. (Running on oeis4.)