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!)
A200666 Number of 0..6 arrays x(0..n-1) of n elements with each no smaller than the sum of its three previous neighbors modulo 7 1
7, 28, 112, 448, 1813, 7322, 29536, 119066, 479993, 1935168, 7802161, 31456852, 126827111, 511338342, 2061602939, 8311924900, 33511832745, 135112262286, 544742594039, 2196280995578, 8854916583356, 35701054472646, 143938712300001 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 6 of A200668

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

EXAMPLE

Some solutions for n=6

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

..6....4....3....6....4....6....4....5....5....6....1....3....4....6....0....5

..1....4....4....3....5....3....4....1....5....4....5....6....6....4....3....0

..6....6....2....6....5....6....6....1....4....0....4....5....4....6....6....4

..6....6....2....1....6....5....4....4....6....5....6....5....0....5....2....6

..6....3....5....5....2....1....5....6....6....5....6....5....5....6....5....6

CROSSREFS

Sequence in context: A026642 A200467 A002042 * A207098 A037597 A037702

Adjacent sequences:  A200663 A200664 A200665 * A200667 A200668 A200669

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 August 4 08:14 EDT 2020. Contains 336201 sequences. (Running on oeis4.)