Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124953
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A124953
%S A124953 1,25,119,445,1947,8575,38747,177223,819187,3816247,17891349,84312583,
%T A124953 399037959,1895486995,9032061297,43155077395,206685100995,991968231607,
%U A124953 4769763119885,22973188788967,110815066535017,535263089155897
%N A124953 Number of base 25 circular n-digit numbers with adjacent digits differing 
               by 2 or less.
%C A124953 [Empirical] a(base,n)=a(base-1,n)+A005191(n+1) for base>=2.int(n/2)+1
%o A124953 (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod 
               N]`>2)+($[(i+1)mod N]`-$[i]`>2))
%Y A124953 Sequence in context: A160437 A050589 A020152 this_sequence A126412 A078815 
               A036057
%Y A124953 Adjacent sequences: A124950 A124951 A124952 this_sequence A124954 A124955 
               A124956
%K A124953 nonn
%O A124953 0,2
%A A124953 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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research