login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007800 From a problem in AI planning: a(n) = 4+a(n-1)+a(n-2)+a(n-3)+a(n-4)-a(n-5)-a(n-6)-a(n-7), n>7. 2
1, 2, 4, 8, 16, 31, 59, 111, 207, 384, 710, 1310, 2414, 4445, 8181, 15053, 27693, 50942, 93704, 172356, 317020, 583099, 1072495, 1972635, 3628251, 6673404, 12274314, 22575994, 41523738, 76374073, 140473833, 258371673, 475219609, 874065146 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

The number of length n binary words with fewer than 3 0-digits between any pair of consecutive 1-digits. [From Jeffrey Liese (jliese(AT)calpoly.edu), December 23,2010]

CROSSREFS

Cf. A062544.

Sequence in context: A174439 A000128 A106399 * A102726 A188900 A189075

Adjacent sequences:  A007797 A007798 A007799 * A007801 A007802 A007803

KEYWORD

nonn

AUTHOR

Peter Jonsson [ petej(AT)ida.liu.se ]

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 08:21 EST 2012. Contains 205998 sequences.