A212460 a(n) = ceiling(3n*log(3n)).

4, 11, 20, 30, 41, 53, 64, 77, 89, 103, 116, 130, 143, 157, 172, 186, 201, 216, 231, 246, 262, 277, 293, 308, 324, 340, 356, 373, 389, 405, 422, 439, 455, 472, 489, 506, 523, 540, 558, 575, 592, 610, 627, 645, 663, 680

Offset: 1

Author

Mohammad K. Azarian, May 31 2012

Keywords

• easy
• nonn

Links

• Vincenzo Librandi, Table of n, a(n) for n = 1..1000
• Amya Luo, Pattern Avoidance in Nonnesting Permutations, Undergraduate Thesis, Dartmouth College (2024). See p. 16.

Crossrefs

Cf. A050502, A050504, A212455, A212456, A212457, A212458, A212459, A212461, A212462.

Programs

Derive

PROG(y := [], x := 100, LOOP(IF(x = 0, RETURN y), y := ADJOIN(CEILING(3·x·LOG(3·x)), y), x := x - 1))

Magma

[Ceiling(3*n*Log(3*n)): n in [1..80]]; // Vincenzo Librandi, Feb 13 2013

Mathematica

Table[Ceiling[3*n*Log[3*n]], {n, 80}] (* Vincenzo Liobrandi, Feb 13 2013 *)

PARI

a(n) = ceil(3*n*log(3*n)); \\ Michel Marcus, Jan 11 2016

Formula

a(n) = A050502(3*n). - Michel Marcus, Jan 11 2016