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!)
A255995 Number of length n+4 0..1 arrays with at most one downstep in every n consecutive neighbor pairs. 1
32, 64, 100, 144, 196, 257, 328, 410, 504, 611, 732, 868, 1020, 1189, 1376, 1582, 1808, 2055, 2324, 2616, 2932, 3273, 3640, 4034, 4456, 4907, 5388, 5900, 6444, 7021, 7632, 8278, 8960, 9679, 10436, 11232, 12068, 12945, 13864, 14826, 15832, 16883, 17980 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Row 4 of A255992.
LINKS
FORMULA
Empirical: a(n) = (1/6)*n^3 + 2*n^2 + (143/6)*n + 6 for n>2.
Empirical g.f.: x*(32 - 64*x + 36*x^2 - 4*x^4 + x^5) / (1 - x)^4. - Colin Barker, Jan 25 2018
EXAMPLE
Some solutions for n=4:
..0....1....1....1....0....1....1....1....0....1....1....0....0....1....0....0
..0....1....0....1....1....1....0....0....1....0....0....0....0....0....0....1
..0....1....0....0....0....0....0....0....1....0....0....0....0....1....1....0
..0....0....0....0....0....1....1....0....1....1....0....1....0....1....0....0
..0....0....0....1....1....1....1....0....0....1....1....1....0....1....0....1
..0....0....0....1....1....1....1....0....0....1....0....0....1....1....0....1
..0....0....0....0....0....1....0....0....0....1....1....0....0....1....0....1
..1....1....0....0....1....1....0....1....1....1....1....0....0....1....1....0
CROSSREFS
Cf. A255992.
Sequence in context: A195330 A122616 A174312 * A144908 A172419 A069492
KEYWORD
nonn
AUTHOR
R. H. Hardin, Mar 13 2015
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 25 11:16 EDT 2024. Contains 371967 sequences. (Running on oeis4.)