login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A200665 Number of 0..5 arrays x(0..n-1) of n elements with each no smaller than the sum of its three previous neighbors modulo 6 0
6, 21, 75, 267, 938, 3283, 11516, 40399, 141745, 497298, 1744684, 6121152, 21475315, 75342932, 264330011, 927363850, 3253519870, 11414498822, 40046099291, 140495874086, 492909198404, 1729299730308, 6066994825927, 21285162746386 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 5 of A200668

LINKS

Table of n, a(n) for n=1..24.

EXAMPLE

Some solutions for n=6

..0....2....3....0....3....4....1....1....2....0....2....4....0....1....0....1

..3....4....3....0....5....5....5....4....2....3....2....5....1....3....1....2

..3....1....0....0....5....3....2....5....5....5....5....4....5....5....5....3

..1....2....5....0....3....4....5....4....5....4....3....2....1....4....3....3

..2....5....3....0....4....3....4....4....4....5....4....5....2....3....4....3

..5....3....3....4....4....4....5....3....4....4....0....5....2....1....4....3

CROSSREFS

Sequence in context: A000390 A000391 A107660 * A200466 A200249 A207097

Adjacent sequences:  A200662 A200663 A200664 * A200666 A200667 A200668

KEYWORD

nonn

AUTHOR

R. H. Hardin Nov 20 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 29 18:41 EST 2021. Contains 349416 sequences. (Running on oeis4.)