Permutations of 0-to-n with prime sums of adjacent terms, or Square chains with zero

[zak seidov]

Dear Seqfans,
In A090460 and A071983,
permutations of 1-to-n with prime sums of adjacent
terms are considered. 

But what if also zero is included?

For n=15 we have one 0-to-15 solution (1 for 1-15),
for n=16 we have two 0-to-16 solutions (1 for 1-16),
for n=17 we have two 0-to-17 solutions (1 for 1-17),
for n=18-22 no soln,
for n=23 we have four 0-to-23 solutions (3 for 1-23),
for n=24 no soln, 
for n=25 we have 12 0-to-25 solutions (10 for 1-25),
for n=26 we have 14 0-to-25 solutions (12 for 1-26), 
etc.

Could someone (T.D.Noe?) please check/calculate this,
thanks,
Zak



		
__________________________________ 
Discover Yahoo! 
Find restaurants, movies, travel and more fun for the weekend. Check it out! 
http://discover.yahoo.com/weekend.html