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!)
A050185 T(2n+7,n), array T as in A051168; a count of Lyndon words. 2

%I #10 Jul 24 2012 11:14:39

%S 0,1,5,22,91,364,1428,5537,21318,81719,312455,1193010,4552275,

%T 17368680,66284554,253086480,966955410,3697182450,14147884842,

%U 54185826156,207712333598,796937116661,3060338457400,11762344331920

%N T(2n+7,n), array T as in A051168; a count of Lyndon words.

%C Is a(n) = A000588(n+3)/7 if n is not a multiple of 7? _R. J. Mathar_, Jul 24 2012

%H <a href="/index/Lu#Lyndon">Index entries for sequences related to Lyndon words</a>

%K nonn

%O 0,3

%A _Clark Kimberling_

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 April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)