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.

A137673 Smallest m such that A137671(m) = n.

Original entry on oeis.org

1, 3, 4, 6, 7, 9, 12, 14, 15, 20, 22, 28, 30, 32, 34, 41, 45, 47, 48, 50, 51, 54, 59, 62, 63, 67, 69, 71, 74, 76, 83, 87, 93, 94, 95, 99, 100, 107, 110, 113, 114, 116, 119, 128, 133, 135, 140, 142, 143, 150, 153, 155, 156, 161, 163, 166, 167, 170, 183, 186, 188, 191
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 05 2008

Keywords

Crossrefs

Programs

  • Mathematica
    b[1] = 1; b[n_] := b[n] = Count[Array[s, n - 1], s[n - 1]]; s[n_] := s[n] = DigitCount[b[n], 2, 1]; seq[len_, nmax_] := Module[{t = Table[0, {len}], c = 0, n = 1, i}, While[c < len && n < nmax, i = b[n]; If[t[[i]] == 0, c++; t[[i]] = n]; n++]; t]; seq[100, 1000] (* Amiram Eldar, Jul 27 2023 *)

Formula

A137671(a(n)) = n and A137671(m) < n for m < a(n).
A137674(n) = a(A137671(A137674(n)-1)) + 1.