Search: id:A004280
Results 1-1 of 1 results found.

%I A004280
%S A004280 1,2,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,43,45,47,
               49,
%T A004280 51,53,55,57,59,61,63,65,67,69,71,73,75,77,79,81,83,85,87,89,91,93,95,
%U A004280 97,99,101,103,105,107,109,111,113,115,117,119,121,123,125,127,129,131
%N A004280 2 together with the odd numbers (essentially the result of the first 
               stage of the sieve of Eratosthenes).
%C A004280 Number of Fibonacci binary words of length n and having no subword 1011. 
               A Fibonacci binary word is a binary word having no 00 subword. Example: 
               a(5)=9 because of the 13 Fibonacci binary words of length 5 the following 
               do not qualify: 11011, 10110, 10111 and 01011. - Emeric Deutsch (deutsch(AT)duke.poly.edu), 
               May 13 2007
%D A004280 F. S. Roberts, Applied Combinatorics, Prentice-Hall, 1984, p. 256.
%H A004280 H. B. Meyer, <a href="http://www.faust.fr.bw.schule.de/mhb/eratosiv.htm">
               Eratosthenes' sieve</a>
%H A004280 <a href="Sindx_Si.html#sieve">Index entries for sequences generated by 
               sieves</a>
%F A004280 G.f.: (1+x^3)/(1-x)^2; a(n)=2n-1+C(1,n)+C(0,n); - Paul Barry (pbarry(AT)wit.ie), 
               Mar 05 2007
%p A004280 1,2,seq(2*n-1,n=2..66); - Emeric Deutsch (deutsch(AT)duke.poly.edu), 
               May 13 2007
%t A004280 Union[ Join[ 2Range[65] - 1, {2}]] (* Robert G. Wilson v *)
%Y A004280 Sequence in context: A042943 A153809 A004274 this_sequence A053224 A091377 
               A005357
%Y A004280 Adjacent sequences: A004277 A004278 A004279 this_sequence A004281 A004282 
               A004283
%K A004280 easy,nonn
%O A004280 0,2
%A A004280 N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.001 seconds