The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A200468 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A200468

Number of 0..7 arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo 8
(history; published version)

#5 by Russ Cox at Sat Mar 31 12:36:39 EDT 2012

AUTHOR

_R. H. Hardin (rhhardin(AT)att.net) _ Nov 18 2011

Discussion

Sat Mar 31

12:36

OEIS Server: https://oeis.org/edit/global/875

#4 by Ron Hardin at Fri Nov 18 09:52:40 EST 2011

STATUS

editing

approved

#3 by Ron Hardin at Fri Nov 18 09:52:37 EST 2011

LINKS

R. H. Hardin, <a href="/A200468/b200468.txt">Table of n, a(n) for n = 1..210</a>

#2 by Ron Hardin at Fri Nov 18 09:52:15 EST 2011

NAME

allocated for Ron HardinNumber of 0..7 arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo 8

DATA

8, 36, 164, 750, 3434, 15446, 69136, 309748, 1386973, 6207948, 27781867, 124317636, 556310068, 2489502301, 11140314293, 49852273554, 223086037878, 998302588120, 4467360525658, 19991251154656, 89460006607948, 400329985806851

OFFSET

1,1

COMMENTS

Column 7 of A200469

EXAMPLE

Some solutions for n=6

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

..7....6....6....5....5....2....6....5....4....4....4....4....4....4....1....5

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

..6....6....6....7....6....4....6....5....3....6....3....2....6....5....7....1

..4....6....3....6....2....7....2....1....7....2....5....4....1....7....7....4

..7....7....6....7....4....4....3....7....4....5....4....5....2....3....7....5

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Nov 18 2011

STATUS

approved

editing

#1 by Ron Hardin at Fri Nov 18 09:36:18 EST 2011

NAME

allocated for Ron Hardin

KEYWORD

allocated

STATUS

approved