[go: up one dir, main page]

login
Revision History for A125396 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of base 8 circular n-digit numbers with adjacent digits differing by 6 or less.
(history; published version)
#12 by Joerg Arndt at Fri Jun 02 12:59:46 EDT 2017
STATUS

reviewed

approved

#11 by Joerg Arndt at Fri Jun 02 11:28:04 EDT 2017
STATUS

proposed

reviewed

#10 by Colin Barker at Fri Jun 02 11:09:33 EDT 2017
STATUS

editing

proposed

#9 by Colin Barker at Fri Jun 02 11:09:25 EDT 2017
FORMULA

Conjectures from Colin Barker, Jun 02 2017: (Start)

G.f.: (1 - x^2 - 12*x^3) / ((1 - x)*(1 - 7*x - 6*x^2)).

a(n) = 1 + ((7-sqrt(73))/2)^n + ((7+sqrt(73))/2)^n for n>0.

a(n) = 8*a(n-1) - a(n-2) - 6*a(n-3) for n>3.

(End)

STATUS

approved

editing

#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 Tue Nov 16 00:29:41 EST 2010
STATUS

proposed

approved

#6 by Charles R Greathouse IV at Tue Nov 16 00:29:39 EST 2010
KEYWORD

nonn,base,new

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(6) for base>=6.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