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.

Showing 1-2 of 2 results.

A324078 a(0) = 1, followed by pairs (value of rarest term, multiplicity of that value). Choose the least value of rarest term if there is a tie.

Original entry on oeis.org

1, 1, 1, 1, 3, 3, 1, 3, 2, 2, 1, 2, 2, 3, 3, 2, 4, 4, 1, 4, 2, 4, 3, 4, 4, 2, 6, 6, 1, 6, 2, 6, 3, 6, 4, 6, 5, 5, 1, 5, 2, 5, 3, 5, 4, 5, 5, 6, 6, 5, 7, 7, 1, 7, 2, 7, 3, 7, 4, 7, 5, 7, 6, 7, 7, 3, 9, 9, 1, 9, 2, 9, 3, 9, 4, 9, 5, 9, 6, 9, 7, 9, 8, 8, 1, 8, 2, 8, 3, 8, 4, 8, 5, 8, 6, 8, 7, 8, 8, 9, 9, 8, 10, 10, 1, 10, 2, 10, 3, 10
Offset: 0

Views

Author

Joerg Arndt, Feb 15 2019

Keywords

Examples

			1, term 1 appears 1 time, term 1 appears 3 times, term 3 appears 1 time, term 3 appears 2 times, term 2 appears 1 time, ...
		

Crossrefs

A324079 is the same sequence with pairs after a(0) swapped.
A324080 is the sequence of rarest values, A324081 gives their multiplicities.

Programs

  • Mathematica
    Nest[Append[#, First@ SortBy[Union@ Tally[Flatten@ #], Last]] &, {{1}}, 55] // Flatten (* Michael De Vlieger, Feb 25 2019 *)

A324080 a(n) is the rarest values appearing recorded in n-th pair in A324078.

Original entry on oeis.org

1, 1, 3, 3, 2, 2, 3, 2, 4, 4, 4, 4, 2, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 6, 5, 7, 7, 7, 7, 7, 7, 7, 3, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 9, 8, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 11, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 5
Offset: 1

Views

Author

Joerg Arndt, Feb 15 2019

Keywords

Comments

Dropping all but the first occurrence of the terms appears to give A080782.

Crossrefs

See A324081 for the multiplicities.

Formula

a(n) = A324078(2*n-1).
a(n) = A324079(2*n).
Showing 1-2 of 2 results.