[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A125467 (Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
A125467 Number of base 32 circular n-digit numbers with adjacent digits differing by 8 or less.
(history; published version)
#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 Wed Nov 17 00:18:17 EST 2010
STATUS

proposed

approved

#6 by Charles R Greathouse IV at Wed Nov 17 00:18:15 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(8) for base>=8.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(8) for base>=8.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 32 circular n-digit numbers with adjacent digits differing by 8 or less.

DATA

1, 32, 472, 5720, 80680, 1160552, 17087368, 255059144, 3847010920, 58470091304, 893868096012, 13725977829244, 211491017541784, 3267183192531056, 50573396314085242, 784031120369340530, 12168860465362831864

OFFSET

0,2

COMMENTS

[empirical] a(base,n)=a(base-1,n)+F(8) for base>=8.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]`>8)+($[(i+1)mod N]`-$[i]`>8))

KEYWORD

nonn

AUTHOR

Ron Hardin (rhh(AT)cadence.com), Dec 28 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 07:08 EDT 2024. Contains 375531 sequences. (Running on oeis4.)