The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A030708 Row 2, where, at stage k>1, write i in row 1 and j in row 2, where i is the number of j's in rows 1 and 2, for j=1,2,...,m, where m=max number in row 1 for stages 1 to j-1; stage 1 is 1 in row 1. 5

%I

%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 Row 2, where, at stage k>1, write i in row 1 and j in row 2, where i is the number of j's in rows 1 and 2, for j=1,2,...,m, where m=max number in row 1 for stages 1 to j-1; stage 1 is 1 in row 1.

%H Sean A. Irvine, <a href="/A030708/b030708.txt">Table of n, a(n) for n = 1..1000</a>

%Y Cf. A030707 (row 1).

%K nonn

%O 1,4

%A _Clark Kimberling_

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 May 7 16:00 EDT 2021. Contains 343652 sequences. (Running on oeis4.)