A081291 -id:A081291 - cp's OEIS frontend

A086433 Contraction-permutation of A085169: a(n) = A082853(A085169(A081291(n))).

0, 1, 2, 4, 3, 5, 6, 10, 13, 12, 7, 9, 8, 11, 14, 15, 16, 18, 17, 28, 29, 37, 41, 40, 33, 36, 35, 39, 19, 20, 24, 27, 26, 21, 23, 22, 25, 30, 32, 31, 38, 34, 42, 43, 44, 46, 45, 47, 48, 52, 55, 54, 49, 51, 50, 53, 84, 85, 86, 88, 87, 112, 113, 126, 131, 130, 121, 125, 124, 129

Offset: 0

Antti Karttunen, Jun 23 2003

nonn

Antti Karttunen, Gatomorphisms (With the complete Scheme source)
Index entries for signature-permutations induced by Catalan automorphisms

Inverse: A086434.

A086434 Contraction-permutation of A085170: a(n) = A082853(A085170(A081291(n))).

Original entry on oeis.org

0, 1, 2, 4, 3, 5, 6, 10, 12, 11, 7, 13, 9, 8, 14, 15, 16, 18, 17, 28, 29, 33, 35, 34, 30, 36, 32, 31, 19, 20, 37, 39, 38, 24, 41, 26, 25, 21, 40, 27, 23, 22, 42, 43, 44, 46, 45, 47, 48, 52, 54, 53, 49, 55, 51, 50, 84, 85, 86, 88, 87, 98, 99, 103, 105, 104, 100, 106, 102, 101

Offset: 0

Antti Karttunen, Jun 23 2003

nonn

A. Karttunen, Gatomorphisms (With the complete Scheme source)
Index entries for signature-permutations induced by Catalan automorphisms

Inverse: A086433.

A007001 Trajectory of 1 under the morphism 1 -> 12, 2 -> 123, 3 -> 1234, etc.

Original entry on oeis.org

1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 1, 2, 3, 1, 2

Offset: 1

N. J. A. Sloane, Mira Bernstein, James Propp

Records in this sequence occur at positions: 1, 2, 5, 14, 42, 132, 429, 1430, ... (which appear to be the Catalan numbers A000108). - Robert G. Wilson v, May 07 2005
The records do occur at Catalan numbers. Of the first C(n) numbers, the number that are equal to k is A033184(n,k), with the one n last. - Franklin T. Adams-Watters, Mar 29 2009
Let (T(1) < T(2) < ... < T(A000108(m))) denote the sequence of Young tableaux of shape (2^m) ordered lexicographically with respect to their columns, and let f(T(i), T(j)) denote the first label of disagreement among T(i) and T(j). Then, empirically, if we take away the zeros from (f(T(1), T(A000108(m) - i + 1)) - f(T(A000108(m) - i), T(A000108(m) - i + 1)), i=1..A000108(m)-1), we obtain the first A000108(m - 1) - 1 terms in this sequence. This is illustrated in the below example. - John M. Campbell, Sep 07 2018
The average of the first k terms tends to 3 as k tends to infinity. - Andrew Slattery, Jan 19 2021

			From _John M. Campbell_, Sep 07 2018: (Start)
Letting m = 5, as above let (T(1) < T(2) < ... < T(42)) denote the lexicographic sequence of Young tableaux of shape (2, 2, 2, 2, 2). In this case, the sequence (f(T(1), T(43 - i)) - f(T(42 - i), T(43 - i)), i=1..41) is equal to (0, 1, 0, 0, 2, 0, 1, 0, 0, 2, 0, 0, 0, 3, 0, 1, 0, 0, 2, 0, 1, 0, 0, 2, 0, 0, 0, 3, 0, 1, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 0). Removing the zeroes from this tuple, we obtain (1, 2, 1, 2, 3, 1, 2, 1, 2, 3, 1, 2, 3), which gives us the first 13 = A000108(m - 1) - 1 terms in this sequence. For example, the first term in the preceding tuple is 0 since T(1) and T(42) are respectively
   [ 5 10] [ 9 10]
   [ 4 9 ] [ 7 8 ]
   [ 3 8 ] [ 5 6 ]
   [ 2 7 ] [ 3 4 ]
   [ 1 6 ] [ 1 2 ]
and T(41) is equal to
   [ 9 10]
   [ 7 8 ]
   [ 5 6 ]
   [ 2 4 ]
   [ 1 3 ]
so that the first letter of disagreement between T(1) and T(42) is 2, and that between T(41) and T(42) is also 2. (End)

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
J. West, Generating trees and forbidden subsequences, Proc. 6th FPSAC [ Conference on Formal Power Series and Algebraic Combinatorics ] (1994), pp. 441-450 (see p. 443).

T. D. Noe, Table of n, a(n) for n = 1..4862 (8 iterations)
C. Banderier, A. Denise, P. Flajolet, M. Bousquet-Mélou et al., Generating Functions for Generating Trees, Discrete Mathematics 246(1-3), March 2002, pp. 29-55.
Antti Karttunen, Notes concerning A080237-tree and related sequences.
S. Lehr, J. Shallit and J. Tromp, On the vector space of the automatic reals, Theoret. Comput. Sci. 163 (1996), no. 1-2, 193-210.
James Propp and N. J. A. Sloane, Email, March 1994
Index entries for sequences that are fixed points of mappings

Cf. A000245, A085182. a(n)=A076050(n)-1. Partial sums: A080336. Positions of ones: A085197. The first occurrence of each n is at A000108(n). See A085180.

Nest[ Flatten[ # /. a_Integer -> Range[a + 1]] &, {1}, 6] (* Robert G. Wilson v, Jan 24 2006 *)

a(n)=local(v,w); if(n<1,0,v=[1]; while(#v

From n > 1 onward a(n) = A080237(A081291(n-1)). - Antti Karttunen, Jul 31 2003

More terms from Larry Reeves (larryr(AT)acm.org), Sep 22 2000

A072795 A014486-indices of the plane binary trees AND plane general trees whose left subtree is just a stick: \. thus corresponding to the parenthesizations whose first element (of the top-level list) is an empty parenthesization: ().

Original entry on oeis.org

1, 2, 4, 5, 9, 10, 11, 12, 13, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 197, 198, 199

Offset: 0

Antti Karttunen Jun 12 2002

nonn

This sequence is induced by the 'flipped form' of the function 'list': (define (flippedlist x) (cons '() x)) when it acts on symbolless S-expressions encoded by A014486/A063171.

Gives in A063171 positions of the terms which begin with digits 10...

Column 0 of A072764, row 0 of A072766, column 1 of A085201. Complement: A081291. Cf. A085223.

Range[0, Length[#]-1] + CatalanNumber[#] & [Flatten[Array[Table[#, CatalanNumber[#]] &, 7, 0]]] (* Paolo Xausa, Mar 01 2024 *)

a(n) = n + A000108(A072643(n)) = A069770(A057548(n)) = A080300(A083937(n))

A239903 List of Restricted-Growth Strings a_{k-1}a_{k-2}...a_{2}a_{1}, with k=2 and a_1 in {0,1} or k>2, a_{k-1}=1 and a_{j+1}>=1+a_j, for k-1>j>0.

Original entry on oeis.org

0, 1, 10, 11, 12, 100, 101, 110, 111, 112, 120, 121, 122, 123, 1000, 1001, 1010, 1011, 1012, 1100, 1101, 1110, 1111, 1112, 1120, 1121, 1122, 1123, 1200, 1201, 1210, 1211, 1212, 1220, 1221, 1222, 1223, 1230, 1231, 1232, 1233, 1234, 10000, 10001, 10010, 10011

Offset: 0

N. J. A. Sloane, Apr 06 2014

We write the nonnegative integers as restricted growth strings (so called by J. Arndt in his book fxtbook.pdf, p. 325) in such a way that the Catalan numbers (cf. A000108) are expressed: 1=1, 10=2, 100=5, 1000=14, etc., 10...0 (with k zeros) = the k-th Catalan number. Once the entries of a restricted-growth string grow above 9, one would need commas or parentheses, say, to separate those entries. See Dejter (2017) for the precise definition.
In the paper "A system of numeration for middle-levels", restricted growth strings (RGSs) are defined as sequences that begin with either 0 or 1, with each successive number to the right being at least zero and at most one greater than its immediate left neighbor. Moreover, apart from case a(0), the RGSs are finite integer sequences of restricted growth which always start with 1 as their first element b_1 in position 1, and from then on, each successive element b_{i+1} in the sequence is restricted to be in range [0,(b_i)+1].
This sequence gives all such finite sequences in size-wise and lexicographic order, represented as decimal numbers by concatenating the integers of such finite sequences (e.g., from [1,2,0,1] we get 1201). The 58784th such sequence is [1, 2, 3, 4, 5, 6, 7, 8, 9, 9], thus a(58784) = 1234567899, after which comes the first RGS, [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], where an element larger than 9 is present, which means that the decimal system employed here is unambiguous only up to n=58784. Note that 58785 = A000108(11)-1.
Also, if one considers Stanley's interpretation (u) of Catalan numbers, "sequences of a_1, a_2, ..., a_n of integers such that a_1 = 0 and 0 <= a_{i+1} <= a_{i} + 1" (e.g., 000, 001, 010, 011, 012 for C_3), and discards their initial zero, then one has a bijective correspondence with Dejter's RGSs of one element shorter length, which in turn are in bijective correspondence with the first C_n terms of this sequence (by discarding any leading zeros), from a(0) to a(C_n - 1). From this follows that the k-th Catalan number, A000108(k) (k>0), is represented in this system as 1 followed by k-1 zeros: a(1)=1, a(2)=10, a(5)=100, a(14)=1000, etc., and also that there exist exactly A000245(k) RGSs of length k.
Note how this differs from other number representations utilizing Catalan numbers, A014418 and A244159, in that while the latter are base-systems, where a simple weighted Sum_{k} digit(k)*C(k) recovers the natural number n (which the n-th numeral of such system represents), in contrast here it is the sum of appropriate terms in Catalan's Triangle (A009766, A030237), obtained by unranking a unique instance of a certain combinatorial structure (one of the Catalan interpretations), that gives a correspondence with a unique natural number. (Cf. also A014486.)
This sequence differs from "Semigreedy Catalan Representation", A244159, for the first time at n=10, where a(10) = 120, while A244159(10) = 121. That is also the first position where A244158(a(n)) <> n.
Please see Dejter's preprint for a more formal mathematical definition and how this number system is applied in relation to Havel's Conjecture on the existence of Hamiltonian cycles in the middle-levels graphs.
a(n) is given by the concatenation (with leading zeros removed) of the terms of row n + 23714 of A370222. - Paolo Xausa, Feb 17 2024

			Catalan's Triangle T(row,col) = A009766 begins with row n=0 and 0<=col<=n as:
  Row 0: 1
  Row 1: 1, 1
  Row 2: 1, 2,  2
  Row 3: 1, 3,  5,  5
  Row 4: 1, 4,  9, 14, 14
  Row 5: 1, 5, 14, 28, 42,  42
  Row 6: 1, 6, 20, 48, 90, 132, 132
  (the leftmost diagonal of 1s is "column 0").
  ...
For example, for n=38, we find that A081290(38)=14, which occurs on row A081288(n)-1 = 4, in columns A081288(n)-1 and A081288(n)-2, i.e., as T(4,4) and T(4,3). Thus we subtract 38-14 to get 24, and we see that the next term downward on the same diagonal, 28, is too large to accommodate into the same sum, so we go one diagonal up, starting now from T(3,2) = 5. This fits in, so we now have 24 - 5 = 19, and also the next term on the same diagonal, T(4,2) = 9, fits in, so we now have 19-9 = 10. The next term on the same diagonal, T(5,2) = 14, would not fit in anymore, so we rewind ourselves back to penultimate column, but one step up from where we started on this diagonal, so T(2,1) = 2, which fits in, 10 - 2 = 8, also the next one T(3,1) = 3, 8 - 3 = 5, and the next one T(4,1) = 4, 5 - 4 = 1, after which comes T(5,1) = 5 > 1, thus we jump to T(1,0) = 1, 1-1 = 0, and T(2,0)=1 would not fit anymore, thus next time the row would be zero, and the algorithm is ready with 1 (14), 2 (5+9), 3 (2+3+4) and 1 (1) terms collected, whose total sum 14+5+9+2+3+4+1 = 38, thus a(38) = 1231.
For n=20, the same algorithm results in 1 (14), 1 (5), 0 (not even the first tentative term T(2,1) = 2 from the column 1 would fit, so it is skipped), and from one row higher we get the needed 1 (1), so the total sum of these is 14+5+0+1 = 20, thus a(20) = 1101.

D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, third edition, Addison-Wesley, 1977, p. 192.
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999, Exercise 19, interpretation (u).

Antti Karttunen, Table of n, a(n) for n = 0..16796
Joerg Arndt, Matters Computational: Ideas, Algorithm, Source Code, Springer, 2011; freely downloadable here: Fxtbook.
Georg Cantor, Über die einfachen Zahlensysteme, Zeitschrift fur Mathematik und Physik, 14 (1869), 121-128.
Italo J. Dejter, A system of numeration for middle levels, arXiv:1012.0995 [math.CO], (2014).
Italo J. Dejter, The role of restricted growth strings in the two middle levels of the Boolean lattice B_(2k+1), University of Puerto Rico, 2018.
Italo J. Dejter, Reinterpreting Mütze's theorem via natural enumeration of ordered rooted trees, arXiv:1911.02100 [math.CO], (2019).
Italo J. Dejter, A numeral system for the middle-levels graphs, Elec. J. Graph Theory and Applications (2021) Vol. 9, No. 1, 137-156. See p. 138.
Italo J. Dejter, Edge-supplementary arc factorizations of odd graphs, uniform 2-factors and Hamilton cycles, arXiv:2203.05326 [math.CO], 2022.
Italo J. Dejter, Integer sequence of Dyck-path single changes, arXiv:2209.11122 [math.CO], 2022.
Italo J. Dejter, A Dyck-word tree that controls all odd graphs, arXiv:2306.14249 [math.CO], 2023.
Aviezri S. Fraenkel, The Use and Usefulness of Numeration Systems, Inf. Comput., 81(1), (1989), 46-61.
Aviezri S. Fraenkel, Systems of numeration, IEEE Symposium on Computer Arithmetic, (1983), 37-42.
Aviezri S. Fraenkel, Systems of numeration, The American Mathematical Monthly, Vol. 92, No. 2 (Feb., 1985), pp. 105-114.
Antti Karttunen, Catalan ranking and unranking functions, OEIS Wiki.
R. P. Stanley, Exercises on Catalan and Related Numbers, interpretation (u) of Catalan numbers, on page 224 (page 4/27 in the November 1 2000 version of the PDF-file).

Cf. A000108 (Catalan numbers), A000245 (their first differences), A009766 (Catalan's triangle), A236855 (the sum of elements in k-th RGS), A236859 (for n>=1, gives the length of the initial ascent 123... in term a(n)), A244159 (different kinds of Catalan number systems).
Other Catalan combinatorial structures represented as integer sequences: A014486/A063171: Dyck words, parenthesizations, etc., A071156/A071158: Similar restricted words encoded with help of A007623 (Integers written in factorial base), A071153/A079436 (Łukasiewicz words).
Cf. A007001, A007623, A014418, A071154, A071159, A081288, A081290, A081291, A082853, A126307, A244155, A244156, A244157, A244158, A370222.

function CatalanNumerals(z)
    z == 0 && return 0
    f(n) = factorial(n)
    t(j, k) = div(f(k+j)*(k-j+1), f(j)*f(k+1))
    k, i = 2, 0
    while z >= t(i, i + 1) i += 1 end
    dig = fill(0, i); dig[1] = 1
    x = z - t(i - 1, i)
    m = i - 1
    while x > 0
        w, s, p = 0, 0, 0
        while w <= x
            p = w
            w += t(m - 1, m + s)
            s += 1
        end
        dig[k] = s - 1
        m -= 1; k += 1; x -= p
    end
    s = ""; for d in dig s *= string(d) end
    parse(Int, s)
end
[CatalanNumerals(n) for n in 0:42] |> println # Peter Luschny, Nov 10 2019

function [ c ] = catrep(z)
i=0; x=0; y=0; s=0;
while z>=(factorial(2*i+1)*(2))/(factorial(i)*factorial(i+2))
i=i+1;
end
y=(factorial(2*i-1)*(2))/(factorial(i-1)*factorial(i+1));
a=zeros(1,i); a(1,1)=1; k=2; x=z-y; m=1;
while x>0
w=0; s=0; p=0;
while w<=x
p=w;
w=w+(factorial(2*i-2*m+s-1)*(s+2))/(factorial(i-1-m)*factorial(i-m+s+1));
s=s+1;
end
m=m+1; a(1,k)=s-1; k=k+1; x=x-p;
end
a
end

A239903full = With[{r = 2*Range[2, 11]-1}, Reverse[Map[FromDigits[r-#] &, Rest[Select[Subsets[Range[2, 21], {10}, 125477], Min[r-#] >= 0 &]]]]];
A239903full[[;;100]] (* Paolo Xausa, Feb 17 2024 *)

define (t(j,k), (factorial(k+j)*(k-j+1))/(factorial(j)*factorial(k+1)));
i:0;
x:19;
z:0;y:0;s:0;
while x>=t(i,i+1) do (i:i+1);
y:t(i-1,i);a:zeromatrix(1,i);a[1,1]:1;k:2;z:x-y;m:1;
while (z>0) do (
w:0,s:0,p=0,
while (w<=z) do (
p:w,
w:w+t(i-1-m,i-m+s),
s:s+1
),
m:m+1,
a[1,k]:s-1,k:k+1,
z:z-p
);
print(a);

\\ Valid for n<58786 (=A000108(11)).
nxt(w)=if(w[1]==#w, vector(#w+1, i, i>#w), my(k=1); while(w[k]>w[k+1], w[k]=0; k++); w[k]++; w)
seq(n)={my(a=vector(n), w=[1]); a[1]=0; for(i=2, #v, a[i]=fromdigits(Vecrev(w)); w=nxt(w)); a} \\ Andrew Howroyd, Jan 24 2023

(define (A239903_only_upto_16794 n) (if (zero? n) n (A235049 (A071159 (A081291 n))))) ;; Gives correct results only up to 16794.
;; The following gives correct results all the way up to n=58784.
(define (A239903 n) (baselist-as-decimal (A239903raw n)))
(definec (A239903raw n) (if (zero? n) (list) (let loop ((n n) (row (A244160 n)) (col (- (A244160 n) 1)) (srow (- (A244160 n) 1)) (catstring (list 0))) (cond ((or (zero? row) (negative? col)) (reverse! (cdr catstring))) ((> (A009766tr row col) n) (loop n srow (- col 1) (- srow 1) (cons 0 catstring))) (else (loop (- n (A009766tr row col)) (+ row 1) col srow (cons (+ 1 (car catstring)) (cdr catstring))))))))
(define (baselist-as-decimal lista) (baselist->n 10 lista))
(define (baselist->n base bex) (let loop ((bex bex) (n 0)) (cond ((null? bex) n) (else (loop (cdr bex) (+ (* n base) (car bex)))))))
;; From Antti Karttunen, Apr 14-19 2014

To find an RGS corresponding to natural number n, one first finds a maximum row index k such that T(k,k-1) <= n in the Catalan Triangle (A009766) illustrated in the Example section. Note that as the last two columns of this triangle consist of Catalan numbers (that is, T(k,k-1) = T(k,k) = A000108(k)), it means that the first number to be subtracted from n is A081290(n) which occurs as a penultimate element of the row A081288(n)-1, in the column A081288(n)-2. The unranking algorithm then proceeds diagonally downwards, keeping the column index the same, and incrementing the row index, as long as it will encounter terms such that their total sum stays less than or equal to n.
If the total sum of encountered terms on that diagonal would exceed n, the algorithm jumps back to the penultimate column of the triangle, but one row higher from where it started the last time, and again starts summing the terms as long as the total sum stays <= n.
When the algorithm eventually reaches either row zero or column less than zero, the result will be a list of numbers, each element being the number of terms summed from each diagonal, so that the diagonal first traversed appears as the first 1 (as that first diagonal will never allow more than one term), and the number of terms summed from the last traversed diagonal appears the last number in the list. These lists of numbers are then concatenated together as decimal numbers.
These steps can also be played backwards in order to recover the corresponding decimal integer n from such a list of numbers, giving a "ranking function" which will be the inverse to this "unranking function".
For n=1..16794 (where 16794 = A000108(10)-2), a(n) = A235049(A071159(A081291(n))). - Antti Karttunen, Apr 14 2014
Alternative, simpler description of the algorithm from Antti Karttunen, Apr 21 2014: (Start)
Consider the following square array, which is Catalan triangle A009766 without its rightmost, "duplicate" column, appropriately transposed (cf. also tables A030237, A033184 and A054445):
   Row| Terms on that row
   ---+--------------------------
    1 |   1   1   1    1    1 ...
    2 |   2   3   4    5    6 ...
    3 |   5   9  14   20   27 ...
    4 |  14  28  48   75  110 ...
    5 |  42  90 165  275  429 ...
    6 | 132 297 572 1001 1638 ...
To compute the n-th RGS, search first for the greatest Catalan number C_k which is <= n (this is A081290(n), found as the first term of row A081288(n)-1). Then, by a greedy algorithm, select from each successive row (moving towards the top of table) as many terms from the beginning of that row as will still fit into n, subtracting them from n as you go. The number of terms selected from the beginning of each row gives each element of the n-th RGS, so that the number of terms selected from the topmost row (all 1's) appears as its last element.
(End)

Description, formula and examples edited/rewritten by Italo J Dejter, Apr 13 2014 and Antti Karttunen, Apr 18 2014

A081288 a(n) is the minimal i such that A000108(i) > n.

Original entry on oeis.org

0, 2, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6

Offset: 0

Antti Karttunen, Mar 17 2003

nonn

Apart from the initial term 0, each n occurs A000245(n-1) times.

Cf. A000108, A000245, A072643, A081289, A081290. Used to compute A081291.

A081288(n) = my(i=0); while(binomial(2*i, i)/(i+1) <= n, i++); i; \\ Michel Marcus, Apr 28 2020

from sympy import catalan
def a(n):
    if n==0: return 0
    i=1
    while True:
        if catalan(i)>n: return i
        else: i+=1
print([a(n) for n in range(101)]) # Indranil Ghosh, Jun 08 2017

A085197 Positions of ones in A007001. Repeating part in each sub-permutation A082315[A014137(n-1)..A014138(n-1)] normalized to begin from 1.

Original entry on oeis.org

1, 3, 6, 8, 11, 15, 17, 20, 22, 25, 29, 31, 34, 38, 43, 45, 48, 50, 53, 57, 59, 62, 64, 67, 71, 73, 76, 80, 85, 87, 90, 92, 95, 99, 101, 104, 108, 113, 115, 118, 122, 127, 133, 135, 138, 140, 143, 147, 149, 152, 154, 157, 161, 163, 166, 170, 175, 177, 180, 182, 185, 189

Offset: 1

Antti Karttunen, Jun 14 2003. Proposed by Wouter Meeussen Mar 15 2003

nonn

From the second term 3 onward also one more than the partial sums of A076050.

Paolo Xausa, Table of n, a(n) for n = 1..16796
Antti Karttunen, Notes concerning A080237-tree and related sequences.

Cf. A085196. First column of A085180.

PositionIndex[Nest[Flatten[Map[Range[#+1] &, #]] &, {1}, 6]][[1]] (* Paolo Xausa, Mar 04 2024 *)

a(n) = A080336(n-1) + n = A082854(A082315(A072795(A081291(n-1)))).

a(n) = n if n < 2, otherwise a(n-1)+A076050(n-1).

A082363 Permutation of natural numbers induced by the contraction of Catalan bijection signature-permutation A082355.

Original entry on oeis.org

0, 1, 4, 2, 3, 10, 11, 12, 5, 6, 13, 9, 7, 8, 28, 29, 32, 30, 31, 33, 34, 35, 14, 15, 36, 18, 16, 17, 37, 38, 41, 24, 25, 39, 26, 19, 20, 40, 27, 23, 21, 22, 84, 85, 88, 86, 87, 94, 95, 96, 89, 90, 97, 93, 91, 92, 98, 99, 102, 100, 101, 103, 104, 105, 42, 43, 106, 46, 44, 45

Offset: 0

Antti Karttunen, Apr 17 2003

nonn

A. Karttunen, Table of n, a(n) for n = 0..1429
A. Karttunen, Gatomorphisms (with the complete Scheme source)
Index entries for signature-permutations induced by Catalan automorphisms

Compare to the plot of A070041.

Inverse of A082364. Cf. also A082361-A082362.

a(n) = A082853(A082355(A081291(n))).

A082364 Permutation of natural numbers induced by the contraction of Catalan bijection signature-permutation A082356.

Original entry on oeis.org

0, 1, 3, 4, 2, 8, 9, 12, 13, 11, 5, 6, 7, 10, 22, 23, 26, 27, 25, 35, 36, 40, 41, 39, 31, 32, 34, 38, 14, 15, 17, 18, 16, 19, 20, 21, 24, 28, 29, 33, 37, 30, 64, 65, 68, 69, 67, 77, 78, 82, 83, 81, 73, 74, 76, 80, 105, 106, 110, 111, 109, 124, 125, 130, 131, 129, 119, 120, 123

Offset: 0

Antti Karttunen, Apr 17 2003

nonn

A. Karttunen, Table of n, a(n) for n = 0..1429
A. Karttunen, Gatomorphisms (with the complete Scheme source)
Index entries for signature-permutations induced by Catalan automorphisms

Compare to the plot of A038776.

Inverse of A082363. Cf. also A082361-A082362.

a(n) = A082853(A082356(A081291(n))).

A236855 a(n) is the sum of digits in A239903(n).

Original entry on oeis.org

0, 1, 1, 2, 3, 1, 2, 2, 3, 4, 3, 4, 5, 6, 1, 2, 2, 3, 4, 2, 3, 3, 4, 5, 4, 5, 6, 7, 3, 4, 4, 5, 6, 5, 6, 7, 8, 6, 7, 8, 9, 10, 1, 2, 2, 3, 4, 2, 3, 3, 4, 5, 4, 5, 6, 7, 2, 3, 3, 4, 5, 3, 4, 4, 5, 6, 5, 6, 7, 8, 4, 5, 5, 6, 7, 6, 7, 8, 9, 7, 8, 9, 10, 11, 3, 4

Offset: 0

Antti Karttunen, Apr 18 2014

			As the 0th Catalan String is empty, indicated by A239903(0)=0, a(0)=0.
As the 18th Catalan String is [1,0,1,2] (A239903(18)=1012), a(18) = 1+0+1+2 = 4.
Note that although the range of validity of A239903 is inherently limited by the decimal representation employed, it doesn't matter here: We have a(58785) = 55, as the corresponding 58785th Catalan String is [1,2,3,4,5,6,7,8,9,10], even though A239903 cannot represent that unambiguously.

Antti Karttunen, Table of n, a(n) for n = 0..16796

Cf. A239903, A014420, A237449, A236859, A009766, A071155, A081291, A034968, A060130.

A236855list[m_] := With[{r = 2*Range[2, m]-1}, Reverse[Map[Total[r-#] &, Select[Subsets[Range[2, 2*m-1], {m-1}], Min[r-#] >= 0 &]]]];
A236855list[6] (* Generates C(6) terms *) (* Paolo Xausa, Feb 19 2024 *)

(define (A236855 n) (apply + (A239903raw n)))
(define (A239903raw n) (if (zero? n) (list) (let loop ((n n) (row (- (A081288 n) 1)) (col (- (A081288 n) 2)) (srow (- (A081288 n) 2)) (catstring (list 0))) (cond ((or (zero? row) (negative? col)) (reverse! (cdr catstring))) ((> (A009766tr row col) n) (loop n srow (- col 1) (- srow 1) (cons 0 catstring))) (else (loop (- n (A009766tr row col)) (+ row 1) col srow (cons (+ 1 (car catstring)) (cdr catstring))))))))
;; Alternative definition:
(define (A236855 n) (let ((x (A071155 (A081291 n)))) (- (A034968 x) (A060130 x))))

a(n) = A034968(x) - A060130(x), where x = A071155(A081291(n)).
For up to n = A000108(11)-2 = 58784, a(n) = A007953(A239903(n)).
Catalan numbers, A000108, give the positions of ones, and the n-th triangular number occurs for the first time at the position immediately before that, i.e., a(A001453(n)) = A000217(n-1).
For each n, a(n) >= A000217(A236859(n)).

cp's OEIS Frontend

A086433 Contraction-permutation of A085169: a(n) = A082853(A085169(A081291(n))).

Views

Author

Keywords

Links

Crossrefs

A086434 Contraction-permutation of A085170: a(n) = A082853(A085170(A081291(n))).

Views

Author

Keywords

Links

Crossrefs

A007001 Trajectory of 1 under the morphism 1 -> 12, 2 -> 123, 3 -> 1234, etc.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A072795 A014486-indices of the plane binary trees AND plane general trees whose left subtree is just a stick: \. thus corresponding to the parenthesizations whose first element (of the top-level list) is an empty parenthesization: ().

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A239903 List of Restricted-Growth Strings a_{k-1}a_{k-2}...a_{2}a_{1}, with k=2 and a_1 in {0,1} or k>2, a_{k-1}=1 and a_{j+1}>=1+a_j, for k-1>j>0.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Julia

MATLAB

Mathematica

Maxima

PARI

Scheme

Formula

Extensions

A081288 a(n) is the minimal i such that A000108(i) > n.

Views

Author

Keywords

Comments

Crossrefs

Programs

PARI

Python

A085197 Positions of ones in A007001. Repeating part in each sub-permutation A082315[A014137(n-1)..A014138(n-1)] normalized to begin from 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A082363 Permutation of natural numbers induced by the contraction of Catalan bijection signature-permutation A082355.

Views

Author

Keywords

Links

Crossrefs