proposed

approved

editing

proposed

Boris Putievskiy, <a href="http://arxiv.org/abs/1212.2732">Transformations Integer Sequences And Pairing Functions</a> , arXiv:1212.2732 [math.CO], 2012.

approved

editing

editing

approved

#^#&/@Table[n-k+1, {n, 10}, {k, n}]//Flatten (* Harvey P. Dale, May 23 2021 *)

approved

editing

proposed

approved

editing

proposed

Sequence B is called a reverse reluctant sequence of sequence A, if B is triangle array read by rows: row number k lists first k elements of the sequence A in reverse order. Sequence A095891 is reverse reluctant sequence of sequence A000312 (number of labeled mappings from n points to themselves (endofunctions): n^n). - _Boris Putievskiy, _, Dec 14 2012

a(n) = A000312(m), where m=(t*t+3*t+4)/2-n, t=floor[((-1+sqrt(8*n-7))/2] ) or ((t*t+3*t+4)/2-n)^((t*t+3*t+4)/2-n), where t=floor[((-1+sqrt(8*n-7))/2]). - _Boris Putievskiy, _, Dec 14 2012

approved

editing

editing

approved

Sequence B is called a reverse reluctant sequence of sequence A, if B is triangle array read by rows: row number k lists first k elements of the sequence A in reverse order. Sequence A095891 is reverse reluctant sequence of sequence A000312 (Number number of labeled mappings from n points to themselves (endofunctions): n^n) . - Boris Putievskiy, Dec 14 2012

Boris Putievskiy, <a href="http://arxiv.org/abs/1212.2732">Transformations Integer Sequences And Pairing Functions</a> arXiv:1212.2732 [math.CO]

Boris Putievskiy, <a href="http://arxiv.org/abs/1212.2732">Transformations Integer Sequences And Pairing Functions</a> arXiv:1212.2732 [math.CO]

a(n) = A000312(m), where m=(t*t+3*t+4)/2-n, t=floor[(-1+sqrt(8*n-7))/2] or ((t*t+3*t+4)/2-n)^((t*t+3*t+4)/2-n), where t=floor[(-1+sqrt(8*n-7))/2]. - Boris Putievskiy, Dec 14 2012

proposed

editing