A241615
Number of length n+2 0..9 arrays with no consecutive three elements summing to more than 9.
Original entry on oeis.org
220, 1210, 6655, 34243, 180829, 963886, 5093737, 26932543, 142701909, 755538278, 3999038946, 21172904049, 112098384491, 593455432350, 3141868198978, 16633824615067, 88062718713584, 466221475528171, 2468274573927916
Offset: 1
Some solutions for n=5
..0....1....0....1....1....7....5....5....1....0....0....1....1....1....1....0
..5....2....1....2....1....0....1....1....3....1....1....2....2....0....7....1
..2....1....3....1....2....0....0....3....1....2....2....4....1....0....1....7
..0....3....1....5....0....4....1....2....2....5....3....3....1....0....0....0
..3....1....0....0....0....0....3....0....4....0....2....0....5....1....4....1
..2....4....8....1....1....3....0....4....0....1....2....3....1....8....1....3
..3....1....1....1....2....3....6....5....4....2....4....4....0....0....2....4
-
r:= [seq(seq([i,j],j=0..9-i),i=0..9)]:
T:= Matrix(55,55,proc(i,j) if r[i][1]=r[j][2] and r[i][1]+r[i][2]+r[j][1]<=9 then 1 else 0 fi end proc):
U[0]:= Vector(55,1):
for n from 1 to 50 do U[n]:= T . U[n-1] od:
seq(U[0]^%T . U[j], j=1..50); # Robert Israel, Sep 03 2019
A241618
Number of length n+2 0..12 arrays with no consecutive three elements summing to more than 12.
Original entry on oeis.org
455, 3185, 22295, 145873, 980031, 6645821, 44678543, 300535053, 2025793471, 13644835113, 91879275469, 618858084619, 4168290681519, 28073432645895, 189079333842687, 1273493381875147, 8577194140275861, 57768891197339641
Offset: 1
Some solutions for n=5
..0....3....0....0....0....3....3....3....0....3....3....3....0....3....0....0
..6....3....0....0....0....3....0....0....3....3....0....6....0....3....3....9
..0....0....0....2...11....3....8....2....6....4....5....1....7....1....0....0
..3....0....6....8....0....0....2....0....1....4....0....0....5....1....0....1
..2....1....1....0....1....3....2....4....4....1....7....1....0....0....7....7
..2....2....4....1....1....7....3....3....4....1....0....1....5....7....0....1
..4....4....0....9....7....0....0....0....0...10....1....5....0....5....3....0
-
r:= [seq(seq([i,j],j=0..12-i),i=0..12)]:
T:= Matrix(91,91,proc(i,j) if r[i][1]=r[j][2] and r[i][1]+r[i][2]+r[j][1]<=12 then 1 else 0 fi end proc):
U[0]:= Vector(91,1):
for n from 1 to 40 do U[n]:= T . U[n-1] od:
seq(U[0]^%T . U[j], j=1..40); # Robert Israel, Sep 03 2019
A241608
Number of length n+2 0..2 arrays with no consecutive three elements summing to more than 2.
Original entry on oeis.org
10, 20, 40, 76, 147, 287, 556, 1077, 2091, 4057, 7868, 15264, 29613, 57445, 111438, 216184, 419380, 813563, 1578253, 3061693, 5939450, 11522085, 22351978, 43361147, 84117349, 163181309, 316559417, 614101361, 1191310271, 2311051970, 4483266305
Offset: 1
Some solutions for n=5:
..1....0....2....0....1....2....2....1....0....1....1....0....1....1....1....0
..0....1....0....0....0....0....0....1....1....0....0....0....0....0....0....1
..1....0....0....0....1....0....0....0....0....1....1....0....1....0....0....0
..0....0....0....0....0....0....0....1....1....1....0....1....1....1....0....0
..0....2....0....0....0....1....0....1....1....0....0....0....0....0....1....0
..1....0....1....0....1....0....1....0....0....1....2....0....1....1....1....0
..1....0....0....2....0....0....1....0....0....0....0....2....1....0....0....0
A241609
Number of length n+2 0..3 arrays with no consecutive three elements summing to more than 3.
Original entry on oeis.org
20, 50, 125, 295, 711, 1730, 4175, 10077, 24377, 58928, 142396, 344201, 832011, 2010980, 4860690, 11748840, 28397936, 68640170, 165909570, 401018224, 969296175, 2342874854, 5662936565, 13687818660, 33084669767, 79968578621
Offset: 1
Some solutions for n=5:
..1....2....3....2....1....0....3....0....1....1....1....1....1....3....2....0
..0....1....0....1....2....1....0....0....1....1....0....1....1....0....0....1
..1....0....0....0....0....2....0....0....0....0....1....0....1....0....0....1
..0....0....1....0....0....0....1....0....1....2....2....0....1....2....3....1
..0....0....2....1....1....1....1....0....1....1....0....1....0....1....0....0
..0....2....0....2....2....1....1....0....0....0....0....0....1....0....0....0
..3....1....1....0....0....1....0....1....1....2....0....0....1....2....1....3
A241610
Number of length n+2 0..4 arrays with no consecutive three elements summing to more than 4.
Original entry on oeis.org
35, 105, 315, 889, 2567, 7483, 21631, 62547, 181255, 524877, 1519408, 4399720, 12740155, 36888358, 106810847, 309276700, 895517750, 2592992001, 7508089778, 21739889599, 62948442860, 182269006155, 527765093824, 1528158677522
Offset: 1
Some solutions for n=5
..1....0....2....0....3....2....2....0....2....4....0....1....0....0....0....3
..0....0....0....0....0....2....0....0....0....0....0....2....0....1....2....0
..0....0....1....1....1....0....1....1....0....0....3....0....3....0....0....0
..2....1....2....2....2....0....0....1....0....1....1....1....0....0....1....2
..0....0....0....1....0....0....3....0....0....1....0....1....1....0....3....0
..2....0....0....0....0....0....0....2....0....1....0....2....1....0....0....0
..2....3....4....3....3....3....0....1....3....1....0....0....2....3....1....1
A241611
Number of length n+2 0..5 arrays with no consecutive three elements summing to more than 5.
Original entry on oeis.org
56, 196, 686, 2254, 7586, 25774, 86828, 292621, 988303, 3335451, 11253229, 37977866, 128168421, 432512171, 1459576829, 4925618766, 16622258696, 56094381015, 189299674740, 638822175369, 2155807165360, 7275117316894
Offset: 1
Some solutions for n=5
..2....1....3....0....0....2....1....0....1....0....2....4....0....1....1....2
..0....0....1....0....0....2....2....4....1....0....3....1....0....1....3....2
..1....4....0....1....1....1....2....0....1....3....0....0....0....2....0....1
..0....0....1....2....4....0....1....0....3....1....0....0....0....1....0....2
..0....0....0....2....0....1....2....3....0....0....5....1....0....0....2....1
..0....3....3....1....0....3....0....1....2....2....0....3....0....2....0....2
..2....0....1....2....1....0....1....1....3....2....0....0....4....3....3....2
A241612
Number of length n+2 0..6 arrays with no consecutive three elements summing to more than 6.
Original entry on oeis.org
84, 336, 1344, 5040, 19374, 75180, 289248, 1113348, 4294574, 16553380, 63784786, 245853464, 947613919, 3652200016, 14076313291, 54253546534, 209104275023, 805930938847, 3106231773354, 11972077046301, 46142909963825
Offset: 1
Some solutions for n=5
..0....3....0....3....4....1....2....3....4....1....3....4....2....4....0....2
..0....2....1....0....1....1....0....0....0....5....2....1....0....0....0....3
..1....1....3....0....1....4....1....1....2....0....1....0....2....1....3....0
..3....0....1....3....3....0....1....1....0....1....1....2....3....3....0....3
..0....1....0....0....0....0....0....3....0....1....2....0....1....1....2....2
..3....1....2....0....2....1....4....0....0....0....0....0....1....1....4....1
..2....2....4....0....4....3....0....0....3....4....0....1....1....3....0....3
A241613
Number of length n+2 0..7 arrays with no consecutive three elements summing to more than 7.
Original entry on oeis.org
120, 540, 2430, 10242, 44274, 193194, 835812, 3617703, 15692003, 68014233, 294705961, 1277336862, 5536267273, 23993714457, 103989408537, 450697682809, 1953337206374, 8465825120096, 36691243404754, 159021259038334
Offset: 1
Some solutions for n=5:
..0....0....0....3....3....0....0....2....1....0....3....1....5....1....2....3
..5....2....4....0....0....0....1....0....2....6....1....0....0....0....1....0
..0....1....1....0....3....3....3....0....3....1....3....2....2....3....1....0
..0....1....0....1....2....4....2....0....1....0....0....3....2....4....3....1
..0....3....5....2....0....0....2....3....2....1....0....2....2....0....2....3
..2....0....0....0....3....0....1....2....2....4....1....0....1....2....1....0
..5....1....1....4....4....4....0....1....1....1....2....2....1....1....3....3
A241614
Number of length n+2 0..8 arrays with no consecutive three elements summing to more than 8.
Original entry on oeis.org
165, 825, 4125, 19305, 92697, 449295, 2159025, 10380183, 50011289, 240772037, 1158816022, 5578909654, 26858310661, 129293730680, 622425498913, 2996413264570, 14424866547232, 69441979827433, 334297722590641
Offset: 1
Some solutions for n=5
..3....5....1....3....5....3....2....2....7....1....5....3....5....3....2....1
..1....2....2....5....1....3....4....2....0....3....0....3....1....0....3....1
..2....0....0....0....1....1....2....3....1....0....1....2....2....0....0....4
..0....2....1....2....0....0....2....1....2....1....6....0....4....2....2....3
..2....2....0....4....1....3....4....3....0....3....1....0....2....1....0....1
..0....3....0....0....2....1....0....0....3....3....0....4....0....4....5....3
..6....1....0....2....3....1....4....0....4....1....5....3....6....2....2....3
A241616
Number of length n+2 0..10 arrays with no consecutive three elements summing to more than 10.
Original entry on oeis.org
286, 1716, 10296, 57772, 332761, 1934647, 11151140, 64309245, 371651553, 2146210209, 12390321340, 71551367152, 413187460923, 2385868376437, 13777070958198, 79555740077836, 459390493737184, 2652727959027373
Offset: 1
Some solutions for n=5
..1....1....1....0....0....1....0....1....0....1....1....1....0....0....1....0
..0....1....0....2....0....1....2....4....5....3....0....1....3....1....0....4
..2....6....5....2....8....5....2....2....0....6....7....3....5....6....3....3
..4....2....3....3....0....3....1....2....3....1....2....3....1....0....1....1
..0....1....2....0....1....2....3....0....2....3....1....1....2....3....1....0
..2....1....1....6....3....3....1....4....0....0....7....4....2....1....4....2
..7....3....6....4....5....3....0....2....6....0....1....1....6....4....0....6
Showing 1-10 of 14 results.
Comments