You can't go wrong with https://pgmustard.com. It's helped me so many times. All you need is the output of EXPLAIN (ANALYZE, VERBOSE, BUFFERS, FORMAT JSON).
> A sequential scan over this large table takes a long time:
> ...
> Execution Time: 16.988 ms
I feel like I have a different definition of a "long time", and apparently all my queries suck lol. Also, of course the btree index on (i1, i2, i3, i4, i5, i6) won't be used when querying on only i1 and i5. Felt a bit weird to read that as an "unexpected" outcome in the pg docs, but I guess the writer is just trying to make a contrast with the bloom index on the same column set.