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.

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

Original entry on oeis.org

1, 32, 94, 218, 586, 1562, 4288, 11876, 33250, 93746, 265924, 757976, 2169316, 6229892, 17944006, 51816578, 149965330, 434882642, 1263332452, 3675765416, 10710126976, 31246397456, 91266942586, 266864938646, 781080332332
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, 32) 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,..,32}. See theorem 3.3 in Knopfmacher and others, reference in A124696. - Peter Luschny, Aug 13 2012