|
|
A261017
|
|
a(n) = max k such that A261015(n,k) is not zero.
|
|
5
|
|
|
1, 3, 4, 5, 5, 7, 8, 9, 9, 9, 11, 11, 13, 15, 16, 17, 17, 17, 17, 19, 19, 19, 21, 21, 23, 23, 23, 27, 29, 31, 32, 33, 33, 33, 33, 33, 35, 35, 35, 35, 37, 37, 37, 39, 39, 39, 39, 41, 41, 43, 43, 45, 45, 45, 47, 47, 47, 47
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MATHEMATICA
|
(* This program is not suitable to compute more than a dozen terms. *)
notVis[bits_] := For[i = 0, True, i++, If[SequencePosition[bits, IntegerDigits[i, 2]] == {}, Return[i]]];
T[n_, k_] := Select[Rest[IntegerDigits[#, 2]] & /@ Range[2^n, 2^(n+1) - 1], notVis[#] == k &] // Length;
a[n_] := Do[If[T[n, k] > 0, Return[k]], {k, 2^n - 1, 0, -1}];
|
|
PROG
|
(Haskell)
a261017 = subtract 1 . length . a261019_row
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|