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!)
A082379 Number of length-n 7/3-power-free words over the alphabet {0,1}. 3
1, 2, 4, 6, 10, 14, 20, 24, 30, 40, 48, 56, 64, 76, 82, 92, 106, 124, 142, 152, 172, 192, 210, 220, 234, 256, 284, 308, 314, 332, 356, 372, 392, 420, 456, 488, 524, 560, 588, 608, 640, 684, 736, 764, 796, 832, 874, 892, 912, 948, 994, 1020, 1060, 1112, 1184 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
Juhani Karhumäki and Jeffrey Shallit, Polynomial versus exponential growth in repetition-free binary words, arXiv:math/0304095 [math.CO], April 7 2003.
Juhani Karhumäki and Jeffrey Shallit, Polynomial versus exponential growth in repetition-free binary words, Journal of Combinatorial Theory, Series A 105 (2004) 335-347.
CROSSREFS
Sequence in context: A062425 A121386 A007777 * A167379 A213476 A277085
KEYWORD
nonn
AUTHOR
Ralf Stephan, Apr 10 2003
EXTENSIONS
Name changed by Jeffrey Shallit, Sep 26 2014
More terms from Jeffrey Shallit, Jul 17 2021
STATUS
approved

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 28 05:00 EDT 2024. Contains 372020 sequences. (Running on oeis4.)