This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A212460 #24 Jun 12 2024 12:05:55
%S A212460 4,11,20,30,41,53,64,77,89,103,116,130,143,157,172,186,201,216,231,
%T A212460 246,262,277,293,308,324,340,356,373,389,405,422,439,455,472,489,506,
%U A212460 523,540,558,575,592,610,627,645,663,680
%N A212460 a(n) = ceiling(3n*log(3n)).
%H A212460 Vincenzo Librandi, <a href="/A212460/b212460.txt">Table of n, a(n) for n = 1..1000</a>
%H A212460 Amya Luo, <a href="https://math.dartmouth.edu/theses/undergrad/2024/Luo-thesis.pdf">Pattern Avoidance in Nonnesting Permutations</a>, Undergraduate Thesis, Dartmouth College (2024). See p. 16.
%F A212460 a(n) = A050502(3*n). - _Michel Marcus_, Jan 11 2016
%t A212460 Table[Ceiling[3*n*Log[3*n]], {n, 80}] (* _Vincenzo Liobrandi_, Feb 13 2013 *)
%o A212460 (Derive) PROG(y := [], x := 100, LOOP(IF(x = 0, RETURN y), y := ADJOIN(CEILING(3·x·LOG(3·x)), y), x := x - 1))
%o A212460 (Magma) [Ceiling(3*n*Log(3*n)): n in [1..80]]; // _Vincenzo Librandi_, Feb 13 2013
%o A212460 (PARI) a(n) = ceil(3*n*log(3*n)); \\ _Michel Marcus_, Jan 11 2016
%Y A212460 Cf. A050502, A050504, A212455, A212456, A212457, A212458, A212459, A212461, A212462.
%K A212460 easy,nonn
%O A212460 1,1
%A A212460 _Mohammad K. Azarian_, May 31 2012