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!)
A221522 Number of 0..6 arrays of length n with each element differing from at least one neighbor by 2 or more. 1
0, 30, 130, 900, 5368, 33380, 205080, 1264378, 7787228, 47975704, 295543282, 1820672982, 11216042008, 69095255496, 425653839018, 2622194869596, 16153749662332, 99513440156936, 613041859314376, 3776578532115986 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Column 6 of A221524.
LINKS
FORMULA
Empirical: a(n) = 3*a(n-1) +14*a(n-2) +29*a(n-3) +28*a(n-4) +a(n-5) +27*a(n-6) +8*a(n-7) +2*a(n-8).
Empirical g.f.: 2*x^2*(15 + 20*x + 45*x^2 - 11*x^3 + 33*x^4 + 9*x^5 + 3*x^6) / (1 - 3*x - 14*x^2 - 29*x^3 - 28*x^4 - x^5 - 27*x^6 - 8*x^7 - 2*x^8). - Colin Barker, Oct 18 2017
EXAMPLE
Some solutions for n=6
..0....1....6....1....0....6....4....1....3....3....1....4....2....1....5....6
..4....4....4....4....3....0....6....5....0....5....4....1....5....3....3....2
..3....3....0....2....2....4....2....0....6....0....1....5....6....1....5....2
..0....1....4....5....4....4....0....1....4....4....6....1....1....2....5....0
..0....0....0....4....0....2....6....6....3....5....0....0....2....6....2....2
..5....3....6....1....6....0....2....0....1....2....4....2....4....4....0....0
CROSSREFS
Sequence in context: A307849 A044362 A044743 * A291582 A079588 A100147
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 19 2013
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 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)