%I #11 Aug 25 2022 18:54:59
%S 1,1,2,1,2,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,4,1,2,3,4,1,2,3,
%T 4,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,1,
%U 2,3,4,1,2,3,4,1,2,3,4,1,2,3,4,1,2,3,4
%N Irregular table: row n (n>=1) consists of numbers 1..A084556(n).
%C The term a(n) tells from which position (one-based, starting from the left hand end of permutation) of the corresponding permutation in A030298 the term A030298(n) should be picked from. Use this (instead of A220663) with programming languages like Maple, which use one-based indexing of arrays and vectors.
%H A. Karttunen, <a href="/A220694/b220694.txt">Rows 1..998 of the irregular table, flattened.</a>
%F a(n) = A220663(n)+1.
%e Rows of this irregular table begin as:
%e 1;
%e 1, 2;
%e 1, 2;
%e 1, 2, 3;
%e 1, 2, 3;
%e ...
%t Flatten[Table[Table[Range[n],n!],{n,4}]] (* _Harvey P. Dale_, Aug 25 2022 *)
%o (Scheme): (define (A220694 n) (+ 1 (A220663 n)))
%Y Cf. A220663, A084556, A030298.
%K nonn,tabf
%O 1,3
%A _Antti Karttunen_, Dec 18 2012