A200469 T(n,k)=Number of 0..k arrays x(0..n-1) of n elements with each no smaller than the sum of its four previous neighbors modulo (k+1).

2, 3, 3, 4, 6, 5, 5, 10, 12, 8, 6, 15, 26, 24, 13, 7, 21, 45, 69, 48, 20, 8, 28, 75, 135, 181, 98, 29, 9, 36, 112, 267, 405, 455, 199, 43, 10, 45, 164, 448, 951, 1213, 1120, 400, 63, 11, 55, 225, 750, 1792, 3328, 3627, 2794, 800, 91, 12, 66, 305, 1125, 3434, 7140, 11576, 10846

Offset: 1

Author

R. H. Hardin Nov 18 2011

Keywords

• nonn
• tabl

Comments

Table starts

..2....3.....4.....5......6.......7.......8........9.......10........11

..3....6....10....15.....21......28......36.......45.......55........66

..5...12....26....45.....75.....112.....164......225......305.......396

..8...24....69...135....267.....448.....750.....1125.....1690......2376

.13...48...181...405....951....1792....3434.....5625.....9365.....14256

.20...98...455..1213...3328....7140...15446....28023....51356.....85228

.29..199..1120..3627..11576...28434...69136...139566...281169....509465

.43..400..2794.10846..40309..113193..309748...694953..1539522...3044998

.63..800..6955.32429.140298..450812.1386973..3460458..8429124..18199720

.91.1597.17254.96970.487872.1795581.6207948.17231016.46144179.108782707

Examples

			Some solutions for n=7 k=6
..1....0....0....3....3....0....3....0....3....3....1....1....2....4....2....4
..6....1....5....4....4....1....3....2....4....4....6....6....5....6....2....6
..2....6....5....5....2....2....6....5....2....2....3....1....2....4....4....5
..2....3....3....5....6....4....5....3....6....6....4....3....2....2....4....2
..5....4....6....3....5....0....5....4....1....1....4....6....6....2....5....5
..5....3....5....3....4....6....6....5....6....6....3....5....4....0....6....5
..1....2....6....3....4....5....3....5....3....6....1....4....3....1....6....5
		

Links

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

Crossrefs

Row 2 is A000217(n+1)

Row 3 is A200252

Row 4 is A200253

Row 5 is A200254