cp's OEIS Frontend

A030707 The first list after the following procedure: starting with a list [1] and an empty list, repeatedly add the distinct values already in both lists in ascending order to the second list and add the corresponding frequencies of those values to the first list.

%I A030707 #13 Oct 08 2022 18:30:10
%S A030707 1,1,3,4,1,6,2,1,8,1,3,2,1,11,3,5,3,2,1,13,5,8,4,1,3,2,1,16,7,10,6,3,
%T A030707 4,4,2,1,18,9,12,9,4,6,1,5,1,3,2,1,22,11,14,11,6,8,2,6,2,2,4,1,3,2,1,
%U A030707 25,16,16,13,7,11,3,8,3,3,7,2,4,1,3,2,1,28,19,21
%N A030707 The first list after the following procedure: starting with a list [1] and an empty list, repeatedly add the distinct values already in both lists in ascending order to the second list and add the corresponding frequencies of those values to the first list.
%H A030707 Sean A. Irvine, <a href="/A030707/b030707.txt">Table of n, a(n) for n = 1..1000</a>
%H A030707 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a030/A030707.java">Java program</a> (github)
%Y A030707 Cf. A030708 (2nd list).
%K A030707 nonn
%O A030707 1,3
%A A030707 _Clark Kimberling_
%E A030707 Name revised in line with A030777 by _Peter Munn_, Oct 08 2022