[seqfan] Re: Leading Sum Prime Avoidance

[Ron Hardin]

Leading and trailing sum prime avoidance (added), with an interesting column 1

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

Table starts
.1...2....2......3......3.......4.......5........6........6.........7........7
.0...1....1......4......4......11......16.......23.......23........34.......34
.0...2....4.....17.....18......47......68......119......131.......226......237
.0...6....9.....54.....59.....195.....315......676......786......1571.....1743
.1..11...21....176....204.....898....1653.....4078.....5075.....11512....13456
.0..27...47....610....769....4353....9126....25389....33798.....85437...105502
.0..53..118...2197...3098...22189...50166...156454...222665....640886...845325
.1.133..333...8358..14080..112015..266060...972441..1504758...4956259..6973431
.0.310..984..34005..63868..542397.1445197..6288889.10555156..38994996.58337721
.0.691.3362.132483.261240.2658643.8388620.41384162.74476895.308256904.........

All solutions for n=4 k=3
..4....1....4....4....1....4....4....1....4
..2....3....5....2....5....4....2....3....4
..4....2....5....2....3....2....3....5....4
..4....4....4....4....1....4....1....1....4

Column 1 starts: 1 0 0 0 1 0 0 1 0 0 1 0 1 2 14 66 156 202 151 69 18 7 19 37 78 393 2608 12865 45917 121659

with a curious compression at a(22)=7



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


>________________________________
> From: Ron Hardin <rhhardin at att.net>
>To: "seqfan at list.seqfan.eu" <seqfan at list.seqfan.eu> 
>Sent: Saturday, January 3, 2015 3:56 PM
>Subject: [seqfan] Leading Sum Prime Avoidance
> 
>
>/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)
>
>_______________________________________________
>
>Seqfan Mailing list - http://list.seqfan.eu/
>
>
>