This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091969 Related to Gray codes: see Comments lines. 2
 1, 1, 1, 4, 28, 550, 28456, 4134861, 1781622569, 2407100396065, 10660643722901700, 159393017165624876022, 8189716815725538561261887 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS A (cyclic) Gray code is a listing of the binary n-tuples in a cyclic sequence so that adjacent elements differ in exactly one bit position. So we can describe a Gray code just by listing the bit that gets changed at each step. This gives us a sequence of 2^n numbers, each of which lies in {0..n-1}. Let c_i be the number of times that the bit in position i is changed. This gives us a sequence (c0,c1,...,c_{n-1}), called the transition count of the code, such that each number is even and the sum is 2^n. In addition, if we assume that we reorder everything so that these numbers are nondecreasing (c_0 <= c_1 <= ... <= c_{n-1}) then there is an additional condition c_0 + c_1 + ... + c_{j-1} >= 2^j by noting that all 2^j patterns must occur in the j least-flipped bit positions. Then a(n) is the number of sequences satisfying these conditions. For example, for n=4 there are 4 possible sequences: 2 2 4 8, 2 2 6 6, 2 4 4 6 and 4 4 4 4 and indeed there are cyclic Gray codes with each possible transition count sequence, so a(4) = 4. Additional comments from Rob Pratt: set b_i = c_i / 2. Let a(n,s,p) be the number of solutions to b_0 + b_1 + ... + b_{n-1} = s, 1 <= b_0 <= b_1 <= ... <= b_{n-1} <= p and b_0 + b_1 + ... + b_{j-1} >= 2^j for j = 1 to n. Then a(n,s,p) satisfies the following recursion (written in Mathematica syntax). a[1, s_, p_] := a[1, s, p] = If[1 <= s <= p, 1, 0]; a[n_, s_, p_] := a[n, s, p] = If[s < 2^(n - 1), 0, Sum[a[n - 1, s - k, Min[p, k]], {k, 1, Min[p, s]}]]; we want to compute a(n,2^(n-1),2^(n-1)). LINKS MATHEMATICA a[1, s_, p_] := a[1, s, p] = If[1 <= s <= p, 1, 0]; a[n_, s_, p_] := a[n, s, p] = If[s < 2^(n - 1), 0, Sum[a[n - 1, s - k, Min[p, k]], {k, 1, Min[p, s]}]]; A091969[n_] := a[n, 2^(n-1), 2^(n-1)] CROSSREFS Sequence in context: A203220 A111817 A134048 * A101346 A120604 A203279 Adjacent sequences:  A091966 A091967 A091968 * A091970 A091971 A091972 KEYWORD nonn AUTHOR Gordon Royle, Mar 14 2004 EXTENSIONS More terms from Don Reble and Rob Pratt, Mar 14 2004 a(11)-a(13) from Hans Havermann, Mar 15 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 14 15:30 EST 2018. Contains 317209 sequences. (Running on oeis4.)