The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 4
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Joerg Arndt, Table of n, a(n) for n = 0..10000 EXAMPLE 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, ... MAPLE P:=proc(q) local a, b, c, d, k, n; a:=[1]: b:=[1]: for n from 1 to q do c:=10^6: for k from 1 to nops(b) do if numboccur(a, b[k])

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 25 19:00 EST 2022. Contains 350572 sequences. (Running on oeis4.)