cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A124719 Number of base 26 circular n-digit numbers with adjacent digits differing by 1 or less.

Original entry on oeis.org

1, 26, 76, 176, 472, 1256, 3442, 9518, 26608, 74912, 212206, 604058, 1726582, 4952246, 14246644, 41090936, 118785568, 344073056, 998415598, 2901784298, 8445850762, 24614293082, 71820129424, 209785569908, 613390314046
Offset: 0

Views

Author

R. H. Hardin, Dec 28 2006

Keywords

Comments

[Empirical] a(base,n)=a(base-1,n)+A002426(n+1) for base>=1.int(n/2)+1
a(n) = T(n, 26) where T(n, k) = Sum_{j=1..k} (1+2*cos(j*Pi/(k+1)))^n. These are the number of smooth cyclic words of length n over the alphabet {1,2,..,26}. See theorem 3.3 in Knopfmacher and others, reference in A124696. - Peter Luschny, Aug 13 2012