This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324079 a(0) = 1, followed by pairs (multiplicity of rarest term, value of that term). Choose the least value of rarest term if there is a tie. 4
 1, 1, 1, 3, 1, 1, 3, 2, 3, 1, 2, 2, 2, 3, 3, 4, 2, 1, 4, 2, 4, 3, 4, 4, 4, 6, 2, 1, 6, 2, 6, 3, 6, 4, 6, 5, 6, 1, 5, 2, 5, 3, 5, 4, 5, 5, 5, 6, 6, 7, 5, 1, 7, 2, 7, 3, 7, 4, 7, 5, 7, 6, 7, 7, 7, 9, 3, 1, 9, 2, 9, 3, 9, 4, 9, 5, 9, 6, 9, 7, 9, 8, 9, 1, 8, 2, 8, 3, 8, 4, 8, 5, 8, 6, 8, 7, 8, 8, 8, 9, 9, 10, 8, 1, 10 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS Same as A324078 with pairs after a(0) swapped. LINKS Michael De Vlieger, Table of n, a(n) for n = 0..10000 EXAMPLE 1, 1 time term 1, 3 times term 1, 1 time term 3, 2 times term 3, 1 time term 2, 2 times terms 2, ... 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 December 7 05:14 EST 2019. Contains 329839 sequences. (Running on oeis4.)