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.

User: Gilberto Brito de Almeida

Gilberto Brito de Almeida's wiki page.

Gilberto Brito de Almeida has authored 2 sequences.

A374773 a(n):= #G_{2n}(3n+1) for n >= 1, where G_{2n}(3n+1) is the set of all pure (2n)-sparse gapset of genus 3n+1 and n a positive integer.

Original entry on oeis.org

3, 8, 22, 54, 135, 331, 808
Offset: 1

Author

Keywords

Crossrefs

Cf. A348619.

A348619 a(n) = #G_{2n}(3n) for n >= 0, where G_{K}(N) is the set of pure K-sparse gapset of genus N.

Original entry on oeis.org

1, 2, 5, 12, 30, 70, 167, 395, 936, 2212
Offset: 0

Author

Keywords

Comments

A 'gapset' is a finite subset G of IN, ordered in the natural order, satisfying the postulate: 'If z in G and z = x + y for some x, y in IN, then x or y is in G.' G is a 'gapset of genus n' means that G has n elements. G is a 'k-sparse gapset' if the distance between any consecutive elements of G is at most k. A 'pure k-sparse gapset' G is a k-sparse gapset such there exist consecutive elements l and l' in G which assume this upper bound, i.e., such that l' - l = k.