[seqfan] Leading Sum Prime Avoidance

[Ron Hardin]

/tmp/ewl
T(n,k)=Number of length n 1..(k+2) arrays with no leading partial sum equal to a prime

Table starts
..1....2.....2.......3.......3........4........5.........6.........6..........7
..1....3.....5......10......11.......20.......28........37........41.........54
..1....8....15......40......49......105......163.......253.......307........466
..2...20....45.....160.....222......576.....1026......1849......2461.......4195
..4...50...135.....670....1087.....3383.....6814.....13843.....20012......37643
..6..126...421....3001....5604....20393....45472....102595....161277.....338402
.11..329..1466...13503...29038...121774...297210....758766...1313695....3093457
.20..956..5403...60408..150268...709169..1936867...5719495..10916298...28507728
.33.2897.19417..270370..764508..4121638.12941917..43758333..91142820..262001403
.62.8341.69205.1192385.3857845.24622476.88456127.333905794.755234611.2410105286


All solutions for n=7 k=1
..1....1....1....1....1....1....1....1....1....1....1
..3....3....3....3....3....3....3....3....3....3....3
..2....2....2....2....2....2....2....2....2....2....2
..3....3....2....2....2....3....3....3....3....2....2
..3....3....2....1....1....1....1....3....3....1....2
..3....2....2....3....1....2....2....2....3....3....2
..3....2....2....2....2....3....2....1....1....3....3


 
rhhardin at mindspring.com
rhhardin at att.net (either)