This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A164316 #30 Nov 01 2024 12:41:34
%S A164316 1,2,4,5,7,11,16,23,34,50,73,107,157,230,337,494,724,1061,1555,2279,
%T A164316 3340,4895,7174,10514,15409,22583,33097,48506,71089,104186,152692,
%U A164316 223781,327967,480659,704440,1032407,1513066,2217506,3249913,4762979,6980485,10230398
%N A164316 Number of binary strings of length n with no substrings equal to 000, 001, or 010.
%H A164316 Alois P. Heinz, <a href="/A164316/b164316.txt">Table of n, a(n) for n = 0..2000</a> (first 500 terms from R. H. Hardin)
%H A164316 Dominika Závacká, Cristina Dalfó, and Miquel Angel Fiol, <a href="https://ceur-ws.org/Vol-3792/paper19.pdf">Integer sequences from k-iterated line digraphs</a>, CEUR: Proc. 24th Conf. Info. Tech. - Appl. and Theory (ITAT 2024) Vol 3792, 156-161. See p. 161, Table 2.
%H A164316 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,1).
%F A164316 G.f.: -(2*x^2+x+1)/(x^3+x-1). - _R. J. Mathar_, Nov 28 2011
%F A164316 a(n) = 4 + Sum_{i=0..n-3} a(i) for n>2. - _Greg Dresden_, Jul 02 2021
%e A164316 All solutions for n=6: 101100 101101 101110 101111 011011 011100 011101 011110 011111 111011 110110 110111 111100 111101 111110 111111.
%t A164316 LinearRecurrence[{1, 0, 1}, {1, 2, 4}, 80] (* _Vladimir Joseph Stephan Orlovsky_, Feb 15 2012, edited by _Greg Dresden_, Jul 02 2021 *)
%K A164316 easy,nonn
%O A164316 0,2
%A A164316 _R. H. Hardin_, Aug 12 2009
%E A164316 Edited by _Alois P. Heinz_, Oct 11 2017