_R. H. Hardin (rhhardin(AT)att.net), _, Dec 28 2006
_R. H. Hardin (rhhardin(AT)att.net), _, Dec 28 2006
proposed
approved
nonn,base
approved
proposed
nonn,new
nonn
Ron R. H. Hardin (rhhardin(AT)att.net), Dec 28 2006
[Empirical] a(base,n)=a(base-1,n)+F(9) for base>=9.int(n/2)+1, and F(d) is the largest coefficient in (1+x+...+x^(2d))^n
nonn,new
nonn
nonn,new
nonn
Ron Hardin (rhhrhhardin(AT)cadenceatt.comnet), Dec 28 2006
[empiricalEmpirical] a(base,n)=a(base-1,n)+F(9) for base>=9.int(n/2)+1, and F(d) is the largest coefficient in (1+x+...+x^(2d))^n
nonn,new
nonn
Number of base 15 circular n-digit numbers with adjacent digits differing by 9 or less.
1, 15, 195, 2355, 30815, 406085, 5368137, 71010283, 939514247, 12431027733, 164481297235, 2176344002529, 28796451350825, 381022400987113, 5041526746028345, 66707344009697885, 882643292356416807
0,2
[empirical] a(base,n)=a(base-1,n)+F(9) for base>=9.int(n/2)+1, and F(d) is the largest coefficient in (1+x+...+x^(2d))^n
(S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod N]`>9)+($[(i+1)mod N]`-$[i]`>9))
nonn
Ron Hardin (rhh(AT)cadence.com), Dec 28 2006
approved