cp's OEIS Frontend

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.

A266120 Local maxima of A265894 just before its descents: a(n) = A265894(A265899(n) - 1).

This page as a plain text file.
%I A266120 #9 Dec 25 2015 21:05:17
%S A266120 1,2,6,4,7,10,11,10,25,19,38,23,39,20,29,40,51,62,70,77,79,78,73,66,
%T A266120 57,47,118,91,68,49,106,71,147,93,57,108,62,112,61,105,174,89,141,68,
%U A266120 104,154,224,100,139,191,80,105,136,172,215,263,98,116,135,154,174,192,210,225,238,248,254,257,256,251,244,233,219,204,187,169,151,133
%N A266120 Local maxima of A265894 just before its descents: a(n) = A265894(A265899(n) - 1).
%H A266120 Antti Karttunen, <a href="/A266120/b266120.txt">Table of n, a(n) for n = 1..2016</a>
%F A266120 a(n) = A265894(A265899(n) - 1).
%o A266120 (PARI)
%o A266120 A099563(n) = { my(i=2,dig=0); until(0==n, dig = n % i; n = (n - dig)/i; i++); return(dig); };
%o A266120 A265894 = n -> A099563((2*n)! / n!);
%o A266120 i=0; p=1; n=0; while(i < 2016, n++; k = A265894(n); if(k <= p, i++; write("b266120.txt", i, " ", p)); p = k; );
%o A266120 (Scheme) (define (A266120 n) (A265894 (- (A265899 n) 1)))
%Y A266120 Cf. A265894, A265899.
%K A266120 nonn
%O A266120 1,2
%A A266120 _Antti Karttunen_, Dec 24 2015