Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125389
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A125389
%S A125389 1,26,256,2036,18916,178776,1730542,16983454,168485308,1685157860,
%T A125389 16963782666,171654215594,1744297209730,17786783187134,181898203342216,
%U A125389 1864685423926896,19153948120401164,197081201888778900
%N A125389 Number of base 26 circular n-digit numbers with adjacent digits differing 
               by 5 or less.
%C A125389 [Empirical] a(base,n)=a(base-1,n)+F(5) for base>=5.int(n/2)+1 and F(d) 
               is the largest coefficient in (1+x+...+x^(2d))^n
%o A125389 (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod 
               N]`>5)+($[(i+1)mod N]`-$[i]`>5))
%Y A125389 Sequence in context: A060105 A108645 A086023 this_sequence A109467 A126547 
               A136922
%Y A125389 Adjacent sequences: A125386 A125387 A125388 this_sequence A125390 A125391 
               A125392
%K A125389 nonn
%O A125389 0,2
%A A125389 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 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research