Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125437
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A125437
%S A125437 1,25,319,3385,41647,522925,6717127,87439069,1149386407,15213415573,
%T A125437 202370895399,2701584846557,36157460122255,484806234281277,
%U A125437 6508805756745191,87464954360562805,1176115987345565255
%N A125437 Number of base 25 circular n-digit numbers with adjacent digits differing 
               by 7 or less.
%C A125437 [Empirical] a(base,n)=a(base-1,n)+F(7) for base>=7.int(n/2)+1 and F(d) 
               is the largest coefficient in (1+x+...+x^(2d))^n
%o A125437 (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod 
               N]`>7)+($[(i+1)mod N]`-$[i]`>7))
%Y A125437 Sequence in context: A042206 A128377 A053805 this_sequence A077503 A020275 
               A020233
%Y A125437 Adjacent sequences: A125434 A125435 A125436 this_sequence A125438 A125439 
               A125440
%K A125437 nonn
%O A125437 0,2
%A A125437 Ron Hardin (rhhardin(AT)att.net), Dec 28 2006

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research