|
|
|
|
|
|
|
|
|
#8 by Russ Cox at Sat Mar 31 12:35:02 EDT 2012
|
|
| AUTHOR
|
_R. H. Hardin (rhhardin(AT)att.net), _, Dec 28 2006
|
|
|
|
|
Discussion
|
| Sat Mar 31
| 12:35
| OEIS Server: https://oeis.org/edit/global/875
|
|
|
|
|
|
|
#7 by Charles R Greathouse IV at Thu Nov 18 00:31:10 EST 2010
|
|
|
|
|
|
|
|
#6 by Charles R Greathouse IV at Thu Nov 18 00:31:08 EST 2010
|
|
| KEYWORD
|
nonn,base
|
|
| STATUS
|
approved
proposed
|
|
|
|
|
|
|
#5 by N. J. A. Sloane at Sat Oct 02 03:00:00 EDT 2010
|
|
| KEYWORD
|
nonn,new
nonn
|
|
| AUTHOR
|
Ron R. H. Hardin (rhhardin(AT)att.net), Dec 28 2006
|
|
|
|
|
|
|
#4 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
|
|
| COMMENTS
|
[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
|
|
| KEYWORD
|
nonn,new
nonn
|
|
|
|
|
|
|
#3 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009
|
|
| KEYWORD
|
nonn,new
nonn
|
|
| AUTHOR
|
Ron Hardin (rhhrhhardin(AT)cadenceatt.comnet), Dec 28 2006
|
|
|
|
|
|
|
#2 by N. J. A. Sloane at Sat Nov 10 03:00:00 EST 2007
|
|
| COMMENTS
|
[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
|
|
| KEYWORD
|
nonn,new
nonn
|
|
|
|
|
|
|
#1 by N. J. A. Sloane at Fri Jan 12 03:00:00 EST 2007
|
|
| NAME
|
Number of base 17 circular n-digit numbers with adjacent digits differing by 9 or less.
|
|
| DATA
|
1, 17, 233, 2897, 39897, 556757, 7818749, 110011877, 1548942297, 21813695351, 307225177353, 4327088149379, 60945065497509, 858386080729805, 12090025897059343, 170283256501541477, 2398372933663761385
|
|
| OFFSET
|
0,2
|
|
| COMMENTS
|
[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
|
|
| PROG
|
(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))
|
|
| KEYWORD
|
nonn
|
|
| AUTHOR
|
Ron Hardin (rhh(AT)cadence.com), Dec 28 2006
|
|
| STATUS
|
approved
|
|
|
|
|
|
