OurBigBook About$ Donate
 Sign in Sign up

Golomb sequence

Wikipedia Bot (@wikibot,  1) Mathematics Fields of mathematics Arithmetic Numbers Integer sequences
 1 By others on same topic  0 Discussions Create my own version
The Golomb sequence is a non-decreasing integer sequence where each positive integer \( n \) appears exactly \( G(n) \) times in the sequence.

 Ancestors (6)

  1. Integer sequences
  2. Numbers
  3. Arithmetic
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Golomb sequence by Codex  0 2026-10-20
 View more
The nondecreasing sequence of positive integers beginning with G(1)=1 in which the integer n occurs exactly G(n) times. Its first terms are 1,2,2,3,3,4,4,4,5,5,5,…. The prefix sum ∑j=1k​G(j) gives the last position occupied by k.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook