A384883 - OEIS

A384883

Number of maximal sparse subsets of the binary indices of n, where a set is sparse iff 1 is not a first difference.

1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 2, 2, 3, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 4, 2, 2, 3, 4, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 2, 2, 3, 2, 2, 2, 4, 2, 2, 4, 4, 2, 2, 2, 4, 3, 3, 4, 5, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 2, 2, 3, 1, 1, 1, 2, 1, 1, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,4

COMMENTS

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.

LINKS

Table of n, a(n) for n=0..86.

EXAMPLE

The binary indices of 27 are {1,2,4,5}, with maximal sparse subsets {{1,4},{1,5},{2,4},{2,5}}, so a(27) = 4.

MATHEMATICA

spars[S_]:=Select[Subsets[S], FreeQ[Differences[#], 1]&];

bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n, 2]], 1];

maximize[sys_]:=Complement@@Prepend[Most[Subsets[#]]&/@sys, sys];

Table[Length[maximize[spars[bpe[n]]]], {n, 0, 100}]

CROSSREFS

For subsets of {1..n} we get A000931 (shifted), maximal case of A000045 (shifted).

This is the maximal case of A245564.

The greatest number whose binary indices are one of these subsets is A374356.

For prime instead of binary indices we have A385215, maximal case of A166469.

A034839 counts subsets by number of maximal runs, for strict partitions A116674.

A202064 counts subsets containing n with k maximal runs.

A384877 gives lengths of maximal anti-runs in binary indices, firsts A384878.

A384893 counts subsets by number of maximal anti-runs, for partitions A268193, A384905.

Cf. A000071, A001629, A010049, A044813, A053538, A119900, A202023, A208342, A384177, A384890.

Sequence in context: A317335 A014709 A278161 * A069258 A273134 A126207

Adjacent sequences: A384880 A384881 A384882 * A384884 A384885 A384886

KEYWORD

nonn

AUTHOR

Gus Wiseman, Jul 02 2025

STATUS

approved