Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006355
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006355 Number of binary vectors of length n containing no singletons. +0
21
1, 0, 2, 2, 4, 6, 10, 16, 26, 42, 68, 110, 178, 288, 466, 754, 1220, 1974, 3194, 5168, 8362, 13530, 21892, 35422, 57314, 92736, 150050, 242786, 392836, 635622, 1028458, 1664080, 2692538, 4356618, 7049156, 11405774, 18454930, 29860704, 48315634 (list; graph; listen)
OFFSET

0,3

COMMENT

Number of cvtemplates at n-2 letters given <= 2 consecutive consonants or vowels (n >= 4).

Number of (n,2) Freiman-Wyner sequences.

Diagonal sums of the Riordan array ((1-x+x^2)/(1-x), x/(1-x)), A072405 (where this begins 1,0,1,1,1,1,...). - Paul Barry (pbarry(AT)wit.ie), May 04 2005

a(n) = A119457(n-1,n-2) for n>2. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 20 2006

REFERENCES

I. F. Blake, The enumeration of certain run length sequences, Information and Control, 55 (1982), 222-237.

Enoch Haga, Room for Expansion, Word Ways, 33 (No. 2, 2000), pp. 106-113 (see p. 110).

A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, id. 16,51.

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 898

FORMULA

a(n+2) = F(n-1) + F(n+2), for n>0.

G.f.: (1-x+x^2)/(1-x-x^2) - Paul Barry (pbarry(AT)wit.ie), May 04 2005

MAPLE

a := n-> if n=0 then 1 else (Matrix([[2, -2]]). Matrix([[1, 1], [1, 0]])^n)[1, 1] fi; seq (a(n), n=0..38); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Aug 18 2008]

CROSSREFS

Except for initial term, = 2*Fibonacci numbers (A000045).

Essentially the same as A055389.

Cf. A097925, A097926.

Essentially the same as A047992, A068922, A054886, and A090991.

Adjacent sequences: A006352 A006353 A006354 this_sequence A006356 A006357 A006358

Sequence in context: A139582 A034410 A050194 this_sequence A055389 A084202 A053637

KEYWORD

nonn,easy,nice

AUTHOR

David M. Bloom.

EXTENSIONS

More terms from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 20 2006

Corrected by T. D. Noe (noe(AT)sspectra.com), Oct 31 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 08:31 EDT 2008. Contains 144667 sequences.


AT&T Labs Research