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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030708 The second 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. 5

%I #13 Oct 08 2022 18:30:06

%S 1,1,1,3,1,3,4,1,2,3,4,6,1,2,3,4,6,8,1,2,3,4,5,6,8,11,1,2,3,4,5,6,8,

%T 11,13,1,2,3,4,5,6,7,8,10,11,13,16,1,2,3,4,5,6,7,8,9,10,11,12,13,16,

%U 18,1,2,3,4,5,6,7,8,9,10,11,12,13,14,16,18,22,1,2

%N The second 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 Sean A. Irvine, <a href="/A030708/b030708.txt">Table of n, a(n) for n = 1..1000</a>

%Y Cf. A030707 (1st list).

%K nonn

%O 1,4

%A _Clark Kimberling_

%E Name revised in line with A030778 by _Peter Munn_, Oct 08 2022

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 16:28 EDT 2024. Contains 371254 sequences. (Running on oeis4.)